./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe028_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_faedc4fc-d82a-4f81-9d9e-1ac3763f9c76/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_faedc4fc-d82a-4f81-9d9e-1ac3763f9c76/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_faedc4fc-d82a-4f81-9d9e-1ac3763f9c76/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_faedc4fc-d82a-4f81-9d9e-1ac3763f9c76/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe028_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_faedc4fc-d82a-4f81-9d9e-1ac3763f9c76/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_faedc4fc-d82a-4f81-9d9e-1ac3763f9c76/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7691712e227ff65b6d2a01f318faf99cbd68ed56 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.1.25-f470102 [2019-12-07 11:02:21,388 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:02:21,389 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:02:21,396 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:02:21,396 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:02:21,397 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:02:21,398 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:02:21,399 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:02:21,401 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:02:21,401 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:02:21,402 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:02:21,402 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:02:21,403 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:02:21,403 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:02:21,404 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:02:21,405 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:02:21,405 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:02:21,406 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:02:21,407 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:02:21,409 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:02:21,410 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:02:21,410 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:02:21,411 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:02:21,411 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:02:21,413 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:02:21,413 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:02:21,413 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:02:21,414 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:02:21,414 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:02:21,415 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:02:21,415 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:02:21,415 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:02:21,416 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:02:21,416 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:02:21,417 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:02:21,417 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:02:21,417 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:02:21,417 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:02:21,417 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:02:21,418 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:02:21,418 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:02:21,419 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_faedc4fc-d82a-4f81-9d9e-1ac3763f9c76/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 11:02:21,429 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:02:21,429 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:02:21,429 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 11:02:21,430 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 11:02:21,430 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 11:02:21,430 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 11:02:21,430 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 11:02:21,430 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 11:02:21,430 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 11:02:21,430 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 11:02:21,430 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 11:02:21,431 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 11:02:21,431 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 11:02:21,431 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 11:02:21,431 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 11:02:21,431 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:02:21,432 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:02:21,432 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:02:21,432 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:02:21,432 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:02:21,432 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 11:02:21,432 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:02:21,432 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 11:02:21,432 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 11:02:21,433 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:02:21,433 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:02:21,433 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:02:21,433 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 11:02:21,433 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:02:21,433 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:02:21,433 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:02:21,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:02:21,434 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:02:21,434 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:02:21,434 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 11:02:21,434 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 11:02:21,434 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:02:21,434 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 11:02:21,434 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:02:21,434 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 11:02:21,435 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_faedc4fc-d82a-4f81-9d9e-1ac3763f9c76/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(__VERIFIER_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 -> 7691712e227ff65b6d2a01f318faf99cbd68ed56 [2019-12-07 11:02:21,535 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:02:21,545 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:02:21,548 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:02:21,549 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:02:21,549 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:02:21,550 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_faedc4fc-d82a-4f81-9d9e-1ac3763f9c76/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/safe028_rmo.opt.i [2019-12-07 11:02:21,589 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_faedc4fc-d82a-4f81-9d9e-1ac3763f9c76/bin/utaipan/data/a9bc23091/868ea7d823c04366a0e0f13370b84f18/FLAG059188ae6 [2019-12-07 11:02:22,039 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:02:22,039 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_faedc4fc-d82a-4f81-9d9e-1ac3763f9c76/sv-benchmarks/c/pthread-wmm/safe028_rmo.opt.i [2019-12-07 11:02:22,051 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_faedc4fc-d82a-4f81-9d9e-1ac3763f9c76/bin/utaipan/data/a9bc23091/868ea7d823c04366a0e0f13370b84f18/FLAG059188ae6 [2019-12-07 11:02:22,060 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_faedc4fc-d82a-4f81-9d9e-1ac3763f9c76/bin/utaipan/data/a9bc23091/868ea7d823c04366a0e0f13370b84f18 [2019-12-07 11:02:22,062 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:02:22,063 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:02:22,064 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:02:22,064 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:02:22,066 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:02:22,066 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:02:22" (1/1) ... [2019-12-07 11:02:22,068 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25138a46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:02:22, skipping insertion in model container [2019-12-07 11:02:22,068 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:02:22" (1/1) ... [2019-12-07 11:02:22,073 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:02:22,103 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:02:22,359 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:02:22,367 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:02:22,414 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:02:22,460 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:02:22,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:02:22 WrapperNode [2019-12-07 11:02:22,461 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:02:22,461 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:02:22,461 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:02:22,462 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:02:22,467 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:02:22" (1/1) ... [2019-12-07 11:02:22,483 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:02:22" (1/1) ... [2019-12-07 11:02:22,501 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:02:22,501 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:02:22,502 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:02:22,502 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:02:22,508 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:02:22" (1/1) ... [2019-12-07 11:02:22,508 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:02:22" (1/1) ... [2019-12-07 11:02:22,512 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:02:22" (1/1) ... [2019-12-07 11:02:22,512 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:02:22" (1/1) ... [2019-12-07 11:02:22,521 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:02:22" (1/1) ... [2019-12-07 11:02:22,525 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:02:22" (1/1) ... [2019-12-07 11:02:22,528 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:02:22" (1/1) ... [2019-12-07 11:02:22,532 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:02:22,532 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:02:22,533 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:02:22,533 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:02:22,533 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:02:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_faedc4fc-d82a-4f81-9d9e-1ac3763f9c76/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 [2019-12-07 11:02:22,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 11:02:22,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 11:02:22,579 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 11:02:22,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 11:02:22,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 11:02:22,580 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 11:02:22,580 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 11:02:22,580 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 11:02:22,580 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 11:02:22,580 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 11:02:22,580 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 11:02:22,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-07 11:02:22,580 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 11:02:22,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:02:22,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:02:22,582 WARN L205 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 11:02:23,020 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:02:23,020 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-12-07 11:02:23,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:02:23 BoogieIcfgContainer [2019-12-07 11:02:23,021 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:02:23,021 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:02:23,021 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:02:23,023 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:02:23,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:02:22" (1/3) ... [2019-12-07 11:02:23,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14542c1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:02:23, skipping insertion in model container [2019-12-07 11:02:23,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:02:22" (2/3) ... [2019-12-07 11:02:23,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14542c1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:02:23, skipping insertion in model container [2019-12-07 11:02:23,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:02:23" (3/3) ... [2019-12-07 11:02:23,025 INFO L109 eAbstractionObserver]: Analyzing ICFG safe028_rmo.opt.i [2019-12-07 11:02:23,031 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 11:02:23,031 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:02:23,036 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 11:02:23,036 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 11:02:23,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,068 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,068 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,072 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,073 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,074 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,075 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,076 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,077 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,078 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,079 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,080 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,081 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,081 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,081 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,085 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,086 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,086 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,086 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,087 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,088 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,089 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,090 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,091 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,092 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,093 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,094 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,095 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,096 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,097 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,098 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,099 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,100 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,101 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,102 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:02:23,116 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-12-07 11:02:23,128 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:02:23,128 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 11:02:23,128 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:02:23,128 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:02:23,128 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:02:23,128 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:02:23,128 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:02:23,128 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:02:23,139 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 223 places, 276 transitions [2019-12-07 11:02:23,141 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 223 places, 276 transitions [2019-12-07 11:02:23,234 INFO L134 PetriNetUnfolder]: 63/273 cut-off events. [2019-12-07 11:02:23,234 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 11:02:23,247 INFO L76 FinitePrefix]: Finished finitePrefix Result has 283 conditions, 273 events. 63/273 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1060 event pairs. 9/218 useless extension candidates. Maximal degree in co-relation 225. Up to 2 conditions per place. [2019-12-07 11:02:23,276 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 223 places, 276 transitions [2019-12-07 11:02:23,332 INFO L134 PetriNetUnfolder]: 63/273 cut-off events. [2019-12-07 11:02:23,332 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 11:02:23,343 INFO L76 FinitePrefix]: Finished finitePrefix Result has 283 conditions, 273 events. 63/273 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1060 event pairs. 9/218 useless extension candidates. Maximal degree in co-relation 225. Up to 2 conditions per place. [2019-12-07 11:02:23,374 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 32976 [2019-12-07 11:02:23,375 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 11:02:27,332 WARN L192 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 132 [2019-12-07 11:02:27,487 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2019-12-07 11:02:27,517 INFO L206 etLargeBlockEncoding]: Checked pairs total: 183707 [2019-12-07 11:02:27,517 INFO L214 etLargeBlockEncoding]: Total number of compositions: 146 [2019-12-07 11:02:27,519 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 117 places, 138 transitions [2019-12-07 11:03:51,634 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 300418 states. [2019-12-07 11:03:51,635 INFO L276 IsEmpty]: Start isEmpty. Operand 300418 states. [2019-12-07 11:03:51,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 11:03:51,668 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:03:51,669 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:03:51,669 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:03:51,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:03:51,673 INFO L82 PathProgramCache]: Analyzing trace with hash -2075695311, now seen corresponding path program 1 times [2019-12-07 11:03:51,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:03:51,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789214957] [2019-12-07 11:03:51,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:03:51,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:03:51,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:03:51,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789214957] [2019-12-07 11:03:51,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:03:51,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:03:51,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221210466] [2019-12-07 11:03:51,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:03:51,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:03:51,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:03:51,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:03:51,896 INFO L87 Difference]: Start difference. First operand 300418 states. Second operand 4 states. [2019-12-07 11:03:52,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:03:52,382 INFO L93 Difference]: Finished difference Result 73618 states and 281612 transitions. [2019-12-07 11:03:52,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:03:52,383 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-07 11:03:52,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:03:52,672 INFO L225 Difference]: With dead ends: 73618 [2019-12-07 11:03:52,673 INFO L226 Difference]: Without dead ends: 52546 [2019-12-07 11:03:52,674 INFO L630 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 [2019-12-07 11:03:53,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52546 states. [2019-12-07 11:03:54,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52546 to 52546. [2019-12-07 11:03:54,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52546 states. [2019-12-07 11:03:54,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52546 states to 52546 states and 190000 transitions. [2019-12-07 11:03:54,296 INFO L78 Accepts]: Start accepts. Automaton has 52546 states and 190000 transitions. Word has length 17 [2019-12-07 11:03:54,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:03:54,297 INFO L462 AbstractCegarLoop]: Abstraction has 52546 states and 190000 transitions. [2019-12-07 11:03:54,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:03:54,297 INFO L276 IsEmpty]: Start isEmpty. Operand 52546 states and 190000 transitions. [2019-12-07 11:03:54,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 11:03:54,331 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:03:54,331 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:03:54,331 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:03:54,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:03:54,331 INFO L82 PathProgramCache]: Analyzing trace with hash -583825164, now seen corresponding path program 1 times [2019-12-07 11:03:54,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:03:54,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137804850] [2019-12-07 11:03:54,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:03:54,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:03:54,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:03:54,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137804850] [2019-12-07 11:03:54,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:03:54,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:03:54,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350791360] [2019-12-07 11:03:54,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:03:54,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:03:54,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:03:54,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:03:54,426 INFO L87 Difference]: Start difference. First operand 52546 states and 190000 transitions. Second operand 3 states. [2019-12-07 11:03:54,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:03:54,647 INFO L93 Difference]: Finished difference Result 49978 states and 178400 transitions. [2019-12-07 11:03:54,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:03:54,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-07 11:03:54,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:03:54,754 INFO L225 Difference]: With dead ends: 49978 [2019-12-07 11:03:54,754 INFO L226 Difference]: Without dead ends: 49978 [2019-12-07 11:03:54,755 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:03:55,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49978 states. [2019-12-07 11:03:55,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49978 to 49978. [2019-12-07 11:03:55,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49978 states. [2019-12-07 11:03:55,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49978 states to 49978 states and 178400 transitions. [2019-12-07 11:03:55,819 INFO L78 Accepts]: Start accepts. Automaton has 49978 states and 178400 transitions. Word has length 27 [2019-12-07 11:03:55,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:03:55,820 INFO L462 AbstractCegarLoop]: Abstraction has 49978 states and 178400 transitions. [2019-12-07 11:03:55,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:03:55,820 INFO L276 IsEmpty]: Start isEmpty. Operand 49978 states and 178400 transitions. [2019-12-07 11:03:55,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 11:03:55,834 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:03:55,834 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:03:55,834 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:03:55,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:03:55,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1333969975, now seen corresponding path program 1 times [2019-12-07 11:03:55,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:03:55,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942855681] [2019-12-07 11:03:55,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:03:55,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:03:55,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:03:55,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942855681] [2019-12-07 11:03:55,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:03:55,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:03:55,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412497219] [2019-12-07 11:03:55,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:03:55,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:03:55,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:03:55,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:03:55,895 INFO L87 Difference]: Start difference. First operand 49978 states and 178400 transitions. Second operand 4 states. [2019-12-07 11:03:56,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:03:56,292 INFO L93 Difference]: Finished difference Result 67250 states and 231265 transitions. [2019-12-07 11:03:56,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:03:56,292 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-07 11:03:56,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:03:56,403 INFO L225 Difference]: With dead ends: 67250 [2019-12-07 11:03:56,404 INFO L226 Difference]: Without dead ends: 67250 [2019-12-07 11:03:56,404 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:03:56,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67250 states. [2019-12-07 11:03:57,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67250 to 64766. [2019-12-07 11:03:57,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64766 states. [2019-12-07 11:03:57,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64766 states to 64766 states and 224064 transitions. [2019-12-07 11:03:57,947 INFO L78 Accepts]: Start accepts. Automaton has 64766 states and 224064 transitions. Word has length 28 [2019-12-07 11:03:57,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:03:57,948 INFO L462 AbstractCegarLoop]: Abstraction has 64766 states and 224064 transitions. [2019-12-07 11:03:57,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:03:57,948 INFO L276 IsEmpty]: Start isEmpty. Operand 64766 states and 224064 transitions. [2019-12-07 11:03:57,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 11:03:57,960 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:03:57,961 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:03:57,961 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:03:57,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:03:57,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1493897438, now seen corresponding path program 1 times [2019-12-07 11:03:57,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:03:57,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663267174] [2019-12-07 11:03:57,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:03:57,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:03:58,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:03:58,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663267174] [2019-12-07 11:03:58,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:03:58,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:03:58,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523668996] [2019-12-07 11:03:58,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:03:58,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:03:58,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:03:58,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:03:58,040 INFO L87 Difference]: Start difference. First operand 64766 states and 224064 transitions. Second operand 5 states. [2019-12-07 11:03:58,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:03:58,163 INFO L93 Difference]: Finished difference Result 28910 states and 94646 transitions. [2019-12-07 11:03:58,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:03:58,164 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-07 11:03:58,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:03:58,201 INFO L225 Difference]: With dead ends: 28910 [2019-12-07 11:03:58,201 INFO L226 Difference]: Without dead ends: 25265 [2019-12-07 11:03:58,201 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:03:58,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25265 states. [2019-12-07 11:03:58,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25265 to 25175. [2019-12-07 11:03:58,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25175 states. [2019-12-07 11:03:58,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25175 states to 25175 states and 82371 transitions. [2019-12-07 11:03:58,668 INFO L78 Accepts]: Start accepts. Automaton has 25175 states and 82371 transitions. Word has length 29 [2019-12-07 11:03:58,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:03:58,669 INFO L462 AbstractCegarLoop]: Abstraction has 25175 states and 82371 transitions. [2019-12-07 11:03:58,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:03:58,669 INFO L276 IsEmpty]: Start isEmpty. Operand 25175 states and 82371 transitions. [2019-12-07 11:03:58,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 11:03:58,698 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:03:58,698 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:03:58,698 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:03:58,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:03:58,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1164695851, now seen corresponding path program 1 times [2019-12-07 11:03:58,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:03:58,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175519050] [2019-12-07 11:03:58,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:03:58,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:03:58,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:03:58,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175519050] [2019-12-07 11:03:58,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:03:58,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:03:58,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092827419] [2019-12-07 11:03:58,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:03:58,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:03:58,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:03:58,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:03:58,750 INFO L87 Difference]: Start difference. First operand 25175 states and 82371 transitions. Second operand 3 states. [2019-12-07 11:03:58,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:03:58,828 INFO L93 Difference]: Finished difference Result 25175 states and 82283 transitions. [2019-12-07 11:03:58,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:03:58,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-07 11:03:58,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:03:58,864 INFO L225 Difference]: With dead ends: 25175 [2019-12-07 11:03:58,865 INFO L226 Difference]: Without dead ends: 25175 [2019-12-07 11:03:58,865 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:03:59,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25175 states. [2019-12-07 11:03:59,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25175 to 24326. [2019-12-07 11:03:59,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24326 states. [2019-12-07 11:03:59,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24326 states to 24326 states and 79932 transitions. [2019-12-07 11:03:59,299 INFO L78 Accepts]: Start accepts. Automaton has 24326 states and 79932 transitions. Word has length 44 [2019-12-07 11:03:59,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:03:59,300 INFO L462 AbstractCegarLoop]: Abstraction has 24326 states and 79932 transitions. [2019-12-07 11:03:59,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:03:59,300 INFO L276 IsEmpty]: Start isEmpty. Operand 24326 states and 79932 transitions. [2019-12-07 11:03:59,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 11:03:59,323 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:03:59,323 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:03:59,323 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:03:59,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:03:59,323 INFO L82 PathProgramCache]: Analyzing trace with hash -541366890, now seen corresponding path program 1 times [2019-12-07 11:03:59,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:03:59,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29498804] [2019-12-07 11:03:59,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:03:59,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:03:59,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:03:59,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29498804] [2019-12-07 11:03:59,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:03:59,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:03:59,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444584658] [2019-12-07 11:03:59,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:03:59,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:03:59,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:03:59,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:03:59,401 INFO L87 Difference]: Start difference. First operand 24326 states and 79932 transitions. Second operand 6 states. [2019-12-07 11:03:59,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:03:59,511 INFO L93 Difference]: Finished difference Result 22997 states and 76777 transitions. [2019-12-07 11:03:59,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:03:59,511 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2019-12-07 11:03:59,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:03:59,540 INFO L225 Difference]: With dead ends: 22997 [2019-12-07 11:03:59,540 INFO L226 Difference]: Without dead ends: 22857 [2019-12-07 11:03:59,540 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:03:59,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22857 states. [2019-12-07 11:03:59,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22857 to 22857. [2019-12-07 11:03:59,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22857 states. [2019-12-07 11:03:59,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22857 states to 22857 states and 76464 transitions. [2019-12-07 11:03:59,951 INFO L78 Accepts]: Start accepts. Automaton has 22857 states and 76464 transitions. Word has length 45 [2019-12-07 11:03:59,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:03:59,951 INFO L462 AbstractCegarLoop]: Abstraction has 22857 states and 76464 transitions. [2019-12-07 11:03:59,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:03:59,951 INFO L276 IsEmpty]: Start isEmpty. Operand 22857 states and 76464 transitions. [2019-12-07 11:03:59,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-07 11:03:59,972 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:03:59,972 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:03:59,972 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:03:59,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:03:59,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1488532936, now seen corresponding path program 1 times [2019-12-07 11:03:59,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:03:59,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680540256] [2019-12-07 11:03:59,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:03:59,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:04:00,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:04:00,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680540256] [2019-12-07 11:04:00,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:04:00,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:04:00,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675526568] [2019-12-07 11:04:00,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:04:00,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:04:00,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:04:00,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:04:00,040 INFO L87 Difference]: Start difference. First operand 22857 states and 76464 transitions. Second operand 3 states. [2019-12-07 11:04:00,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:04:00,133 INFO L93 Difference]: Finished difference Result 22323 states and 74339 transitions. [2019-12-07 11:04:00,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:04:00,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-12-07 11:04:00,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:04:00,164 INFO L225 Difference]: With dead ends: 22323 [2019-12-07 11:04:00,165 INFO L226 Difference]: Without dead ends: 22323 [2019-12-07 11:04:00,165 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:04:00,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22323 states. [2019-12-07 11:04:02,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22323 to 21879. [2019-12-07 11:04:02,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21879 states. [2019-12-07 11:04:02,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21879 states to 21879 states and 73073 transitions. [2019-12-07 11:04:02,257 INFO L78 Accepts]: Start accepts. Automaton has 21879 states and 73073 transitions. Word has length 70 [2019-12-07 11:04:02,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:04:02,257 INFO L462 AbstractCegarLoop]: Abstraction has 21879 states and 73073 transitions. [2019-12-07 11:04:02,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:04:02,257 INFO L276 IsEmpty]: Start isEmpty. Operand 21879 states and 73073 transitions. [2019-12-07 11:04:02,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 11:04:02,278 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:04:02,278 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:04:02,278 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:04:02,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:04:02,278 INFO L82 PathProgramCache]: Analyzing trace with hash 726610784, now seen corresponding path program 1 times [2019-12-07 11:04:02,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:04:02,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261037262] [2019-12-07 11:04:02,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:04:02,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:04:02,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:04:02,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261037262] [2019-12-07 11:04:02,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:04:02,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:04:02,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284720320] [2019-12-07 11:04:02,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:04:02,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:04:02,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:04:02,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:04:02,345 INFO L87 Difference]: Start difference. First operand 21879 states and 73073 transitions. Second operand 3 states. [2019-12-07 11:04:02,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:04:02,406 INFO L93 Difference]: Finished difference Result 21878 states and 73071 transitions. [2019-12-07 11:04:02,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:04:02,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-12-07 11:04:02,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:04:02,434 INFO L225 Difference]: With dead ends: 21878 [2019-12-07 11:04:02,434 INFO L226 Difference]: Without dead ends: 21878 [2019-12-07 11:04:02,434 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:04:02,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21878 states. [2019-12-07 11:04:02,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21878 to 21878. [2019-12-07 11:04:02,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21878 states. [2019-12-07 11:04:02,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21878 states to 21878 states and 73071 transitions. [2019-12-07 11:04:02,833 INFO L78 Accepts]: Start accepts. Automaton has 21878 states and 73071 transitions. Word has length 71 [2019-12-07 11:04:02,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:04:02,834 INFO L462 AbstractCegarLoop]: Abstraction has 21878 states and 73071 transitions. [2019-12-07 11:04:02,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:04:02,834 INFO L276 IsEmpty]: Start isEmpty. Operand 21878 states and 73071 transitions. [2019-12-07 11:04:02,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:04:02,855 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:04:02,855 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:04:02,855 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:04:02,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:04:02,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1049534817, now seen corresponding path program 1 times [2019-12-07 11:04:02,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:04:02,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122688400] [2019-12-07 11:04:02,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:04:02,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:04:02,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:04:02,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122688400] [2019-12-07 11:04:02,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:04:02,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 11:04:02,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13904435] [2019-12-07 11:04:02,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 11:04:02,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:04:02,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 11:04:02,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:04:02,998 INFO L87 Difference]: Start difference. First operand 21878 states and 73071 transitions. Second operand 8 states. [2019-12-07 11:04:03,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:04:03,527 INFO L93 Difference]: Finished difference Result 42343 states and 142090 transitions. [2019-12-07 11:04:03,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 11:04:03,527 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 72 [2019-12-07 11:04:03,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:04:03,582 INFO L225 Difference]: With dead ends: 42343 [2019-12-07 11:04:03,582 INFO L226 Difference]: Without dead ends: 39139 [2019-12-07 11:04:03,583 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2019-12-07 11:04:03,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39139 states. [2019-12-07 11:04:04,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39139 to 33319. [2019-12-07 11:04:04,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33319 states. [2019-12-07 11:04:04,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33319 states to 33319 states and 112452 transitions. [2019-12-07 11:04:04,232 INFO L78 Accepts]: Start accepts. Automaton has 33319 states and 112452 transitions. Word has length 72 [2019-12-07 11:04:04,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:04:04,232 INFO L462 AbstractCegarLoop]: Abstraction has 33319 states and 112452 transitions. [2019-12-07 11:04:04,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 11:04:04,232 INFO L276 IsEmpty]: Start isEmpty. Operand 33319 states and 112452 transitions. [2019-12-07 11:04:04,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:04:04,266 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:04:04,266 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:04:04,266 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:04:04,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:04:04,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1782988305, now seen corresponding path program 2 times [2019-12-07 11:04:04,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:04:04,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454576358] [2019-12-07 11:04:04,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:04:04,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:04:04,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:04:04,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454576358] [2019-12-07 11:04:04,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:04:04,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:04:04,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625136822] [2019-12-07 11:04:04,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:04:04,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:04:04,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:04:04,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:04:04,335 INFO L87 Difference]: Start difference. First operand 33319 states and 112452 transitions. Second operand 5 states. [2019-12-07 11:04:04,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:04:04,459 INFO L93 Difference]: Finished difference Result 39821 states and 132807 transitions. [2019-12-07 11:04:04,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:04:04,459 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-12-07 11:04:04,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:04:04,466 INFO L225 Difference]: With dead ends: 39821 [2019-12-07 11:04:04,467 INFO L226 Difference]: Without dead ends: 7173 [2019-12-07 11:04:04,467 INFO L630 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 [2019-12-07 11:04:04,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7173 states. [2019-12-07 11:04:04,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7173 to 7162. [2019-12-07 11:04:04,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7162 states. [2019-12-07 11:04:04,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7162 states to 7162 states and 21914 transitions. [2019-12-07 11:04:04,571 INFO L78 Accepts]: Start accepts. Automaton has 7162 states and 21914 transitions. Word has length 72 [2019-12-07 11:04:04,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:04:04,572 INFO L462 AbstractCegarLoop]: Abstraction has 7162 states and 21914 transitions. [2019-12-07 11:04:04,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:04:04,572 INFO L276 IsEmpty]: Start isEmpty. Operand 7162 states and 21914 transitions. [2019-12-07 11:04:04,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:04:04,577 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:04:04,577 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:04:04,577 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:04:04,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:04:04,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1176538835, now seen corresponding path program 3 times [2019-12-07 11:04:04,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:04:04,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363075865] [2019-12-07 11:04:04,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:04:04,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:04:04,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:04:04,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363075865] [2019-12-07 11:04:04,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:04:04,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-07 11:04:04,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102518606] [2019-12-07 11:04:04,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 11:04:04,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:04:04,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 11:04:04,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2019-12-07 11:04:04,913 INFO L87 Difference]: Start difference. First operand 7162 states and 21914 transitions. Second operand 17 states. [2019-12-07 11:04:06,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:04:06,488 INFO L93 Difference]: Finished difference Result 14803 states and 44704 transitions. [2019-12-07 11:04:06,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-07 11:04:06,488 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 72 [2019-12-07 11:04:06,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:04:06,498 INFO L225 Difference]: With dead ends: 14803 [2019-12-07 11:04:06,499 INFO L226 Difference]: Without dead ends: 10576 [2019-12-07 11:04:06,499 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=195, Invalid=1211, Unknown=0, NotChecked=0, Total=1406 [2019-12-07 11:04:06,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10576 states. [2019-12-07 11:04:06,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10576 to 9010. [2019-12-07 11:04:06,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9010 states. [2019-12-07 11:04:06,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9010 states to 9010 states and 26986 transitions. [2019-12-07 11:04:06,628 INFO L78 Accepts]: Start accepts. Automaton has 9010 states and 26986 transitions. Word has length 72 [2019-12-07 11:04:06,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:04:06,628 INFO L462 AbstractCegarLoop]: Abstraction has 9010 states and 26986 transitions. [2019-12-07 11:04:06,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 11:04:06,628 INFO L276 IsEmpty]: Start isEmpty. Operand 9010 states and 26986 transitions. [2019-12-07 11:04:06,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:04:06,635 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:04:06,635 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:04:06,635 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:04:06,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:04:06,635 INFO L82 PathProgramCache]: Analyzing trace with hash -631520119, now seen corresponding path program 4 times [2019-12-07 11:04:06,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:04:06,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587953439] [2019-12-07 11:04:06,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:04:06,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:04:07,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:04:07,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587953439] [2019-12-07 11:04:07,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:04:07,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-12-07 11:04:07,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985747702] [2019-12-07 11:04:07,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-07 11:04:07,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:04:07,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-07 11:04:07,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=406, Unknown=0, NotChecked=0, Total=462 [2019-12-07 11:04:07,215 INFO L87 Difference]: Start difference. First operand 9010 states and 26986 transitions. Second operand 22 states. [2019-12-07 11:04:09,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:04:09,583 INFO L93 Difference]: Finished difference Result 15440 states and 46395 transitions. [2019-12-07 11:04:09,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-07 11:04:09,583 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 72 [2019-12-07 11:04:09,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:04:09,595 INFO L225 Difference]: With dead ends: 15440 [2019-12-07 11:04:09,596 INFO L226 Difference]: Without dead ends: 12272 [2019-12-07 11:04:09,596 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=226, Invalid=1414, Unknown=0, NotChecked=0, Total=1640 [2019-12-07 11:04:09,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12272 states. [2019-12-07 11:04:09,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12272 to 11155. [2019-12-07 11:04:09,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11155 states. [2019-12-07 11:04:09,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11155 states to 11155 states and 33773 transitions. [2019-12-07 11:04:09,747 INFO L78 Accepts]: Start accepts. Automaton has 11155 states and 33773 transitions. Word has length 72 [2019-12-07 11:04:09,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:04:09,747 INFO L462 AbstractCegarLoop]: Abstraction has 11155 states and 33773 transitions. [2019-12-07 11:04:09,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-07 11:04:09,747 INFO L276 IsEmpty]: Start isEmpty. Operand 11155 states and 33773 transitions. [2019-12-07 11:04:09,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:04:09,755 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:04:09,755 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:04:09,755 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:04:09,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:04:09,755 INFO L82 PathProgramCache]: Analyzing trace with hash -162566405, now seen corresponding path program 5 times [2019-12-07 11:04:09,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:04:09,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268318114] [2019-12-07 11:04:09,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:04:09,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:04:10,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:04:10,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268318114] [2019-12-07 11:04:10,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:04:10,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-07 11:04:10,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469862081] [2019-12-07 11:04:10,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 11:04:10,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:04:10,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 11:04:10,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-12-07 11:04:10,113 INFO L87 Difference]: Start difference. First operand 11155 states and 33773 transitions. Second operand 18 states. [2019-12-07 11:04:13,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:04:13,538 INFO L93 Difference]: Finished difference Result 17099 states and 50662 transitions. [2019-12-07 11:04:13,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-12-07 11:04:13,538 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 72 [2019-12-07 11:04:13,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:04:13,553 INFO L225 Difference]: With dead ends: 17099 [2019-12-07 11:04:13,553 INFO L226 Difference]: Without dead ends: 13863 [2019-12-07 11:04:13,554 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=405, Invalid=2787, Unknown=0, NotChecked=0, Total=3192 [2019-12-07 11:04:13,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13863 states. [2019-12-07 11:04:13,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13863 to 11129. [2019-12-07 11:04:13,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11129 states. [2019-12-07 11:04:13,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11129 states to 11129 states and 33618 transitions. [2019-12-07 11:04:13,719 INFO L78 Accepts]: Start accepts. Automaton has 11129 states and 33618 transitions. Word has length 72 [2019-12-07 11:04:13,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:04:13,720 INFO L462 AbstractCegarLoop]: Abstraction has 11129 states and 33618 transitions. [2019-12-07 11:04:13,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 11:04:13,720 INFO L276 IsEmpty]: Start isEmpty. Operand 11129 states and 33618 transitions. [2019-12-07 11:04:13,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:04:13,729 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:04:13,729 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:04:13,729 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:04:13,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:04:13,729 INFO L82 PathProgramCache]: Analyzing trace with hash 210711269, now seen corresponding path program 6 times [2019-12-07 11:04:13,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:04:13,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421959066] [2019-12-07 11:04:13,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:04:13,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:04:14,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:04:14,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421959066] [2019-12-07 11:04:14,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:04:14,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-07 11:04:14,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858792020] [2019-12-07 11:04:14,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-07 11:04:14,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:04:14,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-07 11:04:14,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2019-12-07 11:04:14,311 INFO L87 Difference]: Start difference. First operand 11129 states and 33618 transitions. Second operand 23 states. [2019-12-07 11:04:17,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:04:17,277 INFO L93 Difference]: Finished difference Result 17680 states and 52922 transitions. [2019-12-07 11:04:17,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-07 11:04:17,277 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 72 [2019-12-07 11:04:17,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:04:17,295 INFO L225 Difference]: With dead ends: 17680 [2019-12-07 11:04:17,295 INFO L226 Difference]: Without dead ends: 15736 [2019-12-07 11:04:17,296 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 558 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=323, Invalid=2127, Unknown=0, NotChecked=0, Total=2450 [2019-12-07 11:04:17,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15736 states. [2019-12-07 11:04:17,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15736 to 13462. [2019-12-07 11:04:17,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13462 states. [2019-12-07 11:04:17,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13462 states to 13462 states and 39829 transitions. [2019-12-07 11:04:17,498 INFO L78 Accepts]: Start accepts. Automaton has 13462 states and 39829 transitions. Word has length 72 [2019-12-07 11:04:17,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:04:17,499 INFO L462 AbstractCegarLoop]: Abstraction has 13462 states and 39829 transitions. [2019-12-07 11:04:17,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-07 11:04:17,499 INFO L276 IsEmpty]: Start isEmpty. Operand 13462 states and 39829 transitions. [2019-12-07 11:04:17,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:04:17,510 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:04:17,510 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:04:17,510 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:04:17,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:04:17,511 INFO L82 PathProgramCache]: Analyzing trace with hash 617877449, now seen corresponding path program 7 times [2019-12-07 11:04:17,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:04:17,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945068490] [2019-12-07 11:04:17,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:04:17,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:04:17,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:04:17,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945068490] [2019-12-07 11:04:17,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:04:17,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-07 11:04:17,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565293858] [2019-12-07 11:04:17,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-07 11:04:17,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:04:17,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-07 11:04:17,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2019-12-07 11:04:17,996 INFO L87 Difference]: Start difference. First operand 13462 states and 39829 transitions. Second operand 20 states. [2019-12-07 11:04:20,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:04:20,256 INFO L93 Difference]: Finished difference Result 17242 states and 51084 transitions. [2019-12-07 11:04:20,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-07 11:04:20,256 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 72 [2019-12-07 11:04:20,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:04:20,272 INFO L225 Difference]: With dead ends: 17242 [2019-12-07 11:04:20,272 INFO L226 Difference]: Without dead ends: 17180 [2019-12-07 11:04:20,273 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=180, Invalid=1380, Unknown=0, NotChecked=0, Total=1560 [2019-12-07 11:04:20,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17180 states. [2019-12-07 11:04:20,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17180 to 14488. [2019-12-07 11:04:20,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14488 states. [2019-12-07 11:04:20,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14488 states to 14488 states and 42936 transitions. [2019-12-07 11:04:20,489 INFO L78 Accepts]: Start accepts. Automaton has 14488 states and 42936 transitions. Word has length 72 [2019-12-07 11:04:20,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:04:20,489 INFO L462 AbstractCegarLoop]: Abstraction has 14488 states and 42936 transitions. [2019-12-07 11:04:20,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-07 11:04:20,489 INFO L276 IsEmpty]: Start isEmpty. Operand 14488 states and 42936 transitions. [2019-12-07 11:04:20,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:04:20,501 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:04:20,501 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:04:20,502 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:04:20,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:04:20,502 INFO L82 PathProgramCache]: Analyzing trace with hash -934704183, now seen corresponding path program 8 times [2019-12-07 11:04:20,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:04:20,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726070274] [2019-12-07 11:04:20,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:04:20,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:04:20,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:04:20,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726070274] [2019-12-07 11:04:20,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:04:20,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 11:04:20,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693278299] [2019-12-07 11:04:20,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 11:04:20,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:04:20,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 11:04:20,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-07 11:04:20,701 INFO L87 Difference]: Start difference. First operand 14488 states and 42936 transitions. Second operand 12 states. [2019-12-07 11:04:21,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:04:21,324 INFO L93 Difference]: Finished difference Result 21801 states and 64614 transitions. [2019-12-07 11:04:21,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 11:04:21,325 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 72 [2019-12-07 11:04:21,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:04:21,345 INFO L225 Difference]: With dead ends: 21801 [2019-12-07 11:04:21,345 INFO L226 Difference]: Without dead ends: 18620 [2019-12-07 11:04:21,345 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2019-12-07 11:04:21,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18620 states. [2019-12-07 11:04:21,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18620 to 15234. [2019-12-07 11:04:21,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15234 states. [2019-12-07 11:04:21,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15234 states to 15234 states and 45405 transitions. [2019-12-07 11:04:21,571 INFO L78 Accepts]: Start accepts. Automaton has 15234 states and 45405 transitions. Word has length 72 [2019-12-07 11:04:21,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:04:21,571 INFO L462 AbstractCegarLoop]: Abstraction has 15234 states and 45405 transitions. [2019-12-07 11:04:21,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 11:04:21,571 INFO L276 IsEmpty]: Start isEmpty. Operand 15234 states and 45405 transitions. [2019-12-07 11:04:21,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:04:21,584 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:04:21,584 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:04:21,584 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:04:21,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:04:21,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1479181461, now seen corresponding path program 9 times [2019-12-07 11:04:21,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:04:21,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478607075] [2019-12-07 11:04:21,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:04:21,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:04:21,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:04:21,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478607075] [2019-12-07 11:04:21,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:04:21,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 11:04:21,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279641409] [2019-12-07 11:04:21,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 11:04:21,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:04:21,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 11:04:21,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-12-07 11:04:21,846 INFO L87 Difference]: Start difference. First operand 15234 states and 45405 transitions. Second operand 15 states. [2019-12-07 11:04:24,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:04:24,868 INFO L93 Difference]: Finished difference Result 21464 states and 63586 transitions. [2019-12-07 11:04:24,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-07 11:04:24,869 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2019-12-07 11:04:24,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:04:24,899 INFO L225 Difference]: With dead ends: 21464 [2019-12-07 11:04:24,900 INFO L226 Difference]: Without dead ends: 18895 [2019-12-07 11:04:24,900 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=167, Invalid=889, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 11:04:24,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18895 states. [2019-12-07 11:04:25,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18895 to 16073. [2019-12-07 11:04:25,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16073 states. [2019-12-07 11:04:25,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16073 states to 16073 states and 47753 transitions. [2019-12-07 11:04:25,135 INFO L78 Accepts]: Start accepts. Automaton has 16073 states and 47753 transitions. Word has length 72 [2019-12-07 11:04:25,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:04:25,136 INFO L462 AbstractCegarLoop]: Abstraction has 16073 states and 47753 transitions. [2019-12-07 11:04:25,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 11:04:25,136 INFO L276 IsEmpty]: Start isEmpty. Operand 16073 states and 47753 transitions. [2019-12-07 11:04:25,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:04:25,149 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:04:25,149 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:04:25,149 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:04:25,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:04:25,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1217226575, now seen corresponding path program 10 times [2019-12-07 11:04:25,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:04:25,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863364213] [2019-12-07 11:04:25,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:04:25,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:04:25,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:04:25,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863364213] [2019-12-07 11:04:25,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:04:25,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-12-07 11:04:25,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480941538] [2019-12-07 11:04:25,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-07 11:04:25,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:04:25,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-07 11:04:25,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2019-12-07 11:04:25,819 INFO L87 Difference]: Start difference. First operand 16073 states and 47753 transitions. Second operand 24 states. [2019-12-07 11:04:28,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:04:28,022 INFO L93 Difference]: Finished difference Result 19120 states and 55792 transitions. [2019-12-07 11:04:28,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-07 11:04:28,022 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 72 [2019-12-07 11:04:28,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:04:28,041 INFO L225 Difference]: With dead ends: 19120 [2019-12-07 11:04:28,041 INFO L226 Difference]: Without dead ends: 19048 [2019-12-07 11:04:28,042 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=310, Invalid=2042, Unknown=0, NotChecked=0, Total=2352 [2019-12-07 11:04:28,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19048 states. [2019-12-07 11:04:28,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19048 to 15989. [2019-12-07 11:04:28,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15989 states. [2019-12-07 11:04:28,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15989 states to 15989 states and 47341 transitions. [2019-12-07 11:04:28,281 INFO L78 Accepts]: Start accepts. Automaton has 15989 states and 47341 transitions. Word has length 72 [2019-12-07 11:04:28,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:04:28,282 INFO L462 AbstractCegarLoop]: Abstraction has 15989 states and 47341 transitions. [2019-12-07 11:04:28,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-07 11:04:28,282 INFO L276 IsEmpty]: Start isEmpty. Operand 15989 states and 47341 transitions. [2019-12-07 11:04:28,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:04:28,295 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:04:28,295 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:04:28,295 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:04:28,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:04:28,295 INFO L82 PathProgramCache]: Analyzing trace with hash -2127245821, now seen corresponding path program 11 times [2019-12-07 11:04:28,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:04:28,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23786040] [2019-12-07 11:04:28,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:04:28,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:04:28,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:04:28,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23786040] [2019-12-07 11:04:28,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:04:28,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-12-07 11:04:28,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859676167] [2019-12-07 11:04:28,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-07 11:04:28,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:04:28,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-07 11:04:28,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2019-12-07 11:04:28,911 INFO L87 Difference]: Start difference. First operand 15989 states and 47341 transitions. Second operand 24 states. [2019-12-07 11:04:34,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:04:34,997 INFO L93 Difference]: Finished difference Result 26755 states and 78734 transitions. [2019-12-07 11:04:34,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-12-07 11:04:34,997 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 72 [2019-12-07 11:04:34,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:04:35,030 INFO L225 Difference]: With dead ends: 26755 [2019-12-07 11:04:35,030 INFO L226 Difference]: Without dead ends: 22180 [2019-12-07 11:04:35,031 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 927 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=449, Invalid=3333, Unknown=0, NotChecked=0, Total=3782 [2019-12-07 11:04:35,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22180 states. [2019-12-07 11:04:35,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22180 to 17279. [2019-12-07 11:04:35,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17279 states. [2019-12-07 11:04:35,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17279 states to 17279 states and 50861 transitions. [2019-12-07 11:04:35,287 INFO L78 Accepts]: Start accepts. Automaton has 17279 states and 50861 transitions. Word has length 72 [2019-12-07 11:04:35,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:04:35,288 INFO L462 AbstractCegarLoop]: Abstraction has 17279 states and 50861 transitions. [2019-12-07 11:04:35,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-07 11:04:35,288 INFO L276 IsEmpty]: Start isEmpty. Operand 17279 states and 50861 transitions. [2019-12-07 11:04:35,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:04:35,301 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:04:35,301 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:04:35,301 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:04:35,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:04:35,302 INFO L82 PathProgramCache]: Analyzing trace with hash -996675705, now seen corresponding path program 12 times [2019-12-07 11:04:35,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:04:35,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524665710] [2019-12-07 11:04:35,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:04:35,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:04:35,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:04:35,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524665710] [2019-12-07 11:04:35,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:04:35,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 11:04:35,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107421321] [2019-12-07 11:04:35,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 11:04:35,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:04:35,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 11:04:35,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-12-07 11:04:35,536 INFO L87 Difference]: Start difference. First operand 17279 states and 50861 transitions. Second operand 15 states. [2019-12-07 11:04:37,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:04:37,702 INFO L93 Difference]: Finished difference Result 23449 states and 68942 transitions. [2019-12-07 11:04:37,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 11:04:37,703 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2019-12-07 11:04:37,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:04:37,729 INFO L225 Difference]: With dead ends: 23449 [2019-12-07 11:04:37,729 INFO L226 Difference]: Without dead ends: 23231 [2019-12-07 11:04:37,730 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=594, Unknown=0, NotChecked=0, Total=702 [2019-12-07 11:04:37,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23231 states. [2019-12-07 11:04:38,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23231 to 20891. [2019-12-07 11:04:38,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20891 states. [2019-12-07 11:04:38,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20891 states to 20891 states and 62051 transitions. [2019-12-07 11:04:38,036 INFO L78 Accepts]: Start accepts. Automaton has 20891 states and 62051 transitions. Word has length 72 [2019-12-07 11:04:38,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:04:38,036 INFO L462 AbstractCegarLoop]: Abstraction has 20891 states and 62051 transitions. [2019-12-07 11:04:38,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 11:04:38,036 INFO L276 IsEmpty]: Start isEmpty. Operand 20891 states and 62051 transitions. [2019-12-07 11:04:38,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:04:38,053 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:04:38,053 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:04:38,054 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:04:38,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:04:38,054 INFO L82 PathProgramCache]: Analyzing trace with hash -57572609, now seen corresponding path program 13 times [2019-12-07 11:04:38,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:04:38,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110055989] [2019-12-07 11:04:38,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:04:38,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:04:38,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:04:38,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110055989] [2019-12-07 11:04:38,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:04:38,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-07 11:04:38,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553269744] [2019-12-07 11:04:38,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-07 11:04:38,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:04:38,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-07 11:04:38,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2019-12-07 11:04:38,607 INFO L87 Difference]: Start difference. First operand 20891 states and 62051 transitions. Second operand 23 states. [2019-12-07 11:04:42,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:04:42,120 INFO L93 Difference]: Finished difference Result 24345 states and 71047 transitions. [2019-12-07 11:04:42,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-07 11:04:42,120 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 72 [2019-12-07 11:04:42,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:04:42,141 INFO L225 Difference]: With dead ends: 24345 [2019-12-07 11:04:42,141 INFO L226 Difference]: Without dead ends: 20833 [2019-12-07 11:04:42,142 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=306, Invalid=1950, Unknown=0, NotChecked=0, Total=2256 [2019-12-07 11:04:42,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20833 states. [2019-12-07 11:04:42,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20833 to 17280. [2019-12-07 11:04:42,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17280 states. [2019-12-07 11:04:42,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17280 states to 17280 states and 51678 transitions. [2019-12-07 11:04:42,403 INFO L78 Accepts]: Start accepts. Automaton has 17280 states and 51678 transitions. Word has length 72 [2019-12-07 11:04:42,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:04:42,403 INFO L462 AbstractCegarLoop]: Abstraction has 17280 states and 51678 transitions. [2019-12-07 11:04:42,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-07 11:04:42,403 INFO L276 IsEmpty]: Start isEmpty. Operand 17280 states and 51678 transitions. [2019-12-07 11:04:42,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:04:42,417 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:04:42,418 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:04:42,418 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:04:42,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:04:42,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1848286879, now seen corresponding path program 14 times [2019-12-07 11:04:42,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:04:42,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854541471] [2019-12-07 11:04:42,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:04:42,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:04:43,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:04:43,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854541471] [2019-12-07 11:04:43,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:04:43,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-07 11:04:43,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056791386] [2019-12-07 11:04:43,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-07 11:04:43,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:04:43,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-07 11:04:43,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2019-12-07 11:04:43,184 INFO L87 Difference]: Start difference. First operand 17280 states and 51678 transitions. Second operand 23 states. [2019-12-07 11:04:48,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:04:48,067 INFO L93 Difference]: Finished difference Result 24277 states and 71750 transitions. [2019-12-07 11:04:48,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-07 11:04:48,068 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 72 [2019-12-07 11:04:48,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:04:48,092 INFO L225 Difference]: With dead ends: 24277 [2019-12-07 11:04:48,092 INFO L226 Difference]: Without dead ends: 22333 [2019-12-07 11:04:48,093 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=244, Invalid=1826, Unknown=0, NotChecked=0, Total=2070 [2019-12-07 11:04:48,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22333 states. [2019-12-07 11:04:48,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22333 to 18098. [2019-12-07 11:04:48,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18098 states. [2019-12-07 11:04:48,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18098 states to 18098 states and 53999 transitions. [2019-12-07 11:04:48,409 INFO L78 Accepts]: Start accepts. Automaton has 18098 states and 53999 transitions. Word has length 72 [2019-12-07 11:04:48,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:04:48,409 INFO L462 AbstractCegarLoop]: Abstraction has 18098 states and 53999 transitions. [2019-12-07 11:04:48,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-07 11:04:48,409 INFO L276 IsEmpty]: Start isEmpty. Operand 18098 states and 53999 transitions. [2019-12-07 11:04:48,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:04:48,421 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:04:48,422 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:04:48,422 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:04:48,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:04:48,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1360553029, now seen corresponding path program 15 times [2019-12-07 11:04:48,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:04:48,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493279375] [2019-12-07 11:04:48,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:04:48,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:04:48,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:04:48,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493279375] [2019-12-07 11:04:48,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:04:48,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-07 11:04:48,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455429531] [2019-12-07 11:04:48,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 11:04:48,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:04:48,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 11:04:48,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-12-07 11:04:48,768 INFO L87 Difference]: Start difference. First operand 18098 states and 53999 transitions. Second operand 17 states. [2019-12-07 11:04:50,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:04:50,546 INFO L93 Difference]: Finished difference Result 25454 states and 75266 transitions. [2019-12-07 11:04:50,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-07 11:04:50,546 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 72 [2019-12-07 11:04:50,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:04:50,578 INFO L225 Difference]: With dead ends: 25454 [2019-12-07 11:04:50,579 INFO L226 Difference]: Without dead ends: 22550 [2019-12-07 11:04:50,579 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=214, Invalid=1346, Unknown=0, NotChecked=0, Total=1560 [2019-12-07 11:04:50,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22550 states. [2019-12-07 11:04:50,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22550 to 18518. [2019-12-07 11:04:50,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18518 states. [2019-12-07 11:04:50,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18518 states to 18518 states and 55222 transitions. [2019-12-07 11:04:50,862 INFO L78 Accepts]: Start accepts. Automaton has 18518 states and 55222 transitions. Word has length 72 [2019-12-07 11:04:50,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:04:50,863 INFO L462 AbstractCegarLoop]: Abstraction has 18518 states and 55222 transitions. [2019-12-07 11:04:50,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 11:04:50,863 INFO L276 IsEmpty]: Start isEmpty. Operand 18518 states and 55222 transitions. [2019-12-07 11:04:50,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:04:50,878 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:04:50,878 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:04:50,878 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:04:50,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:04:50,878 INFO L82 PathProgramCache]: Analyzing trace with hash -579816687, now seen corresponding path program 16 times [2019-12-07 11:04:50,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:04:50,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277075750] [2019-12-07 11:04:50,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:04:50,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:04:51,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:04:51,140 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277075750] [2019-12-07 11:04:51,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:04:51,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 11:04:51,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094346406] [2019-12-07 11:04:51,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 11:04:51,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:04:51,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 11:04:51,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-12-07 11:04:51,141 INFO L87 Difference]: Start difference. First operand 18518 states and 55222 transitions. Second operand 16 states. [2019-12-07 11:04:52,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:04:52,804 INFO L93 Difference]: Finished difference Result 24713 states and 73403 transitions. [2019-12-07 11:04:52,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-07 11:04:52,804 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 72 [2019-12-07 11:04:52,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:04:52,829 INFO L225 Difference]: With dead ends: 24713 [2019-12-07 11:04:52,829 INFO L226 Difference]: Without dead ends: 23845 [2019-12-07 11:04:52,829 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=147, Invalid=909, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 11:04:52,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23845 states. [2019-12-07 11:04:53,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23845 to 19248. [2019-12-07 11:04:53,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19248 states. [2019-12-07 11:04:53,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19248 states to 19248 states and 57413 transitions. [2019-12-07 11:04:53,120 INFO L78 Accepts]: Start accepts. Automaton has 19248 states and 57413 transitions. Word has length 72 [2019-12-07 11:04:53,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:04:53,120 INFO L462 AbstractCegarLoop]: Abstraction has 19248 states and 57413 transitions. [2019-12-07 11:04:53,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 11:04:53,120 INFO L276 IsEmpty]: Start isEmpty. Operand 19248 states and 57413 transitions. [2019-12-07 11:04:53,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:04:53,136 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:04:53,136 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:04:53,136 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:04:53,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:04:53,136 INFO L82 PathProgramCache]: Analyzing trace with hash -550732837, now seen corresponding path program 17 times [2019-12-07 11:04:53,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:04:53,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952094020] [2019-12-07 11:04:53,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:04:53,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:04:54,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:04:54,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952094020] [2019-12-07 11:04:54,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:04:54,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2019-12-07 11:04:54,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375643960] [2019-12-07 11:04:54,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-07 11:04:54,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:04:54,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-07 11:04:54,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2019-12-07 11:04:54,201 INFO L87 Difference]: Start difference. First operand 19248 states and 57413 transitions. Second operand 29 states. [2019-12-07 11:05:00,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:05:00,689 INFO L93 Difference]: Finished difference Result 27326 states and 79847 transitions. [2019-12-07 11:05:00,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-12-07 11:05:00,690 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 72 [2019-12-07 11:05:00,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:05:00,716 INFO L225 Difference]: With dead ends: 27326 [2019-12-07 11:05:00,716 INFO L226 Difference]: Without dead ends: 26068 [2019-12-07 11:05:00,718 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2391 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=881, Invalid=7675, Unknown=0, NotChecked=0, Total=8556 [2019-12-07 11:05:00,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26068 states. [2019-12-07 11:05:01,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26068 to 21322. [2019-12-07 11:05:01,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21322 states. [2019-12-07 11:05:01,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21322 states to 21322 states and 63440 transitions. [2019-12-07 11:05:01,044 INFO L78 Accepts]: Start accepts. Automaton has 21322 states and 63440 transitions. Word has length 72 [2019-12-07 11:05:01,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:05:01,044 INFO L462 AbstractCegarLoop]: Abstraction has 21322 states and 63440 transitions. [2019-12-07 11:05:01,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-07 11:05:01,045 INFO L276 IsEmpty]: Start isEmpty. Operand 21322 states and 63440 transitions. [2019-12-07 11:05:01,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:05:01,061 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:05:01,062 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:05:01,062 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:05:01,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:05:01,062 INFO L82 PathProgramCache]: Analyzing trace with hash 217882191, now seen corresponding path program 18 times [2019-12-07 11:05:01,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:05:01,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662548854] [2019-12-07 11:05:01,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:05:01,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:05:01,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:05:01,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662548854] [2019-12-07 11:05:01,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:05:01,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-12-07 11:05:01,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290458364] [2019-12-07 11:05:01,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-07 11:05:01,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:05:01,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-07 11:05:01,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2019-12-07 11:05:01,801 INFO L87 Difference]: Start difference. First operand 21322 states and 63440 transitions. Second operand 26 states. [2019-12-07 11:05:05,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:05:05,325 INFO L93 Difference]: Finished difference Result 28100 states and 82341 transitions. [2019-12-07 11:05:05,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-07 11:05:05,325 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 72 [2019-12-07 11:05:05,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:05:05,350 INFO L225 Difference]: With dead ends: 28100 [2019-12-07 11:05:05,350 INFO L226 Difference]: Without dead ends: 24517 [2019-12-07 11:05:05,351 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=356, Invalid=2836, Unknown=0, NotChecked=0, Total=3192 [2019-12-07 11:05:05,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24517 states. [2019-12-07 11:05:05,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24517 to 20696. [2019-12-07 11:05:05,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20696 states. [2019-12-07 11:05:05,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20696 states to 20696 states and 61721 transitions. [2019-12-07 11:05:05,662 INFO L78 Accepts]: Start accepts. Automaton has 20696 states and 61721 transitions. Word has length 72 [2019-12-07 11:05:05,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:05:05,662 INFO L462 AbstractCegarLoop]: Abstraction has 20696 states and 61721 transitions. [2019-12-07 11:05:05,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-07 11:05:05,662 INFO L276 IsEmpty]: Start isEmpty. Operand 20696 states and 61721 transitions. [2019-12-07 11:05:05,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:05:05,679 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:05:05,679 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:05:05,679 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:05:05,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:05:05,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1335855007, now seen corresponding path program 19 times [2019-12-07 11:05:05,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:05:05,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734373772] [2019-12-07 11:05:05,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:05:05,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:05:06,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:05:06,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734373772] [2019-12-07 11:05:06,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:05:06,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-12-07 11:05:06,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950166879] [2019-12-07 11:05:06,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-07 11:05:06,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:05:06,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-07 11:05:06,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=586, Unknown=0, NotChecked=0, Total=650 [2019-12-07 11:05:06,417 INFO L87 Difference]: Start difference. First operand 20696 states and 61721 transitions. Second operand 26 states. [2019-12-07 11:05:10,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:05:10,594 INFO L93 Difference]: Finished difference Result 24733 states and 73463 transitions. [2019-12-07 11:05:10,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-07 11:05:10,595 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 72 [2019-12-07 11:05:10,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:05:10,617 INFO L225 Difference]: With dead ends: 24733 [2019-12-07 11:05:10,617 INFO L226 Difference]: Without dead ends: 22065 [2019-12-07 11:05:10,618 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=207, Invalid=1773, Unknown=0, NotChecked=0, Total=1980 [2019-12-07 11:05:10,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22065 states. [2019-12-07 11:05:10,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22065 to 20473. [2019-12-07 11:05:10,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20473 states. [2019-12-07 11:05:10,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20473 states to 20473 states and 60964 transitions. [2019-12-07 11:05:10,911 INFO L78 Accepts]: Start accepts. Automaton has 20473 states and 60964 transitions. Word has length 72 [2019-12-07 11:05:10,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:05:10,912 INFO L462 AbstractCegarLoop]: Abstraction has 20473 states and 60964 transitions. [2019-12-07 11:05:10,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-07 11:05:10,912 INFO L276 IsEmpty]: Start isEmpty. Operand 20473 states and 60964 transitions. [2019-12-07 11:05:10,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:05:10,928 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:05:10,929 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:05:10,929 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:05:10,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:05:10,929 INFO L82 PathProgramCache]: Analyzing trace with hash 982526783, now seen corresponding path program 20 times [2019-12-07 11:05:10,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:05:10,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391946995] [2019-12-07 11:05:10,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:05:10,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:05:11,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:05:11,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391946995] [2019-12-07 11:05:11,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:05:11,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-12-07 11:05:11,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524197136] [2019-12-07 11:05:11,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-07 11:05:11,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:05:11,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-07 11:05:11,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2019-12-07 11:05:11,435 INFO L87 Difference]: Start difference. First operand 20473 states and 60964 transitions. Second operand 22 states. [2019-12-07 11:05:15,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:05:15,369 INFO L93 Difference]: Finished difference Result 32153 states and 94508 transitions. [2019-12-07 11:05:15,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-07 11:05:15,369 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 72 [2019-12-07 11:05:15,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:05:15,398 INFO L225 Difference]: With dead ends: 32153 [2019-12-07 11:05:15,398 INFO L226 Difference]: Without dead ends: 29754 [2019-12-07 11:05:15,398 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=168, Invalid=1392, Unknown=0, NotChecked=0, Total=1560 [2019-12-07 11:05:15,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29754 states. [2019-12-07 11:05:15,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29754 to 23223. [2019-12-07 11:05:15,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23223 states. [2019-12-07 11:05:15,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23223 states to 23223 states and 69103 transitions. [2019-12-07 11:05:15,734 INFO L78 Accepts]: Start accepts. Automaton has 23223 states and 69103 transitions. Word has length 72 [2019-12-07 11:05:15,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:05:15,734 INFO L462 AbstractCegarLoop]: Abstraction has 23223 states and 69103 transitions. [2019-12-07 11:05:15,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-07 11:05:15,734 INFO L276 IsEmpty]: Start isEmpty. Operand 23223 states and 69103 transitions. [2019-12-07 11:05:15,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:05:15,753 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:05:15,753 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:05:15,753 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:05:15,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:05:15,753 INFO L82 PathProgramCache]: Analyzing trace with hash -970803151, now seen corresponding path program 21 times [2019-12-07 11:05:15,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:05:15,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641289645] [2019-12-07 11:05:15,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:05:15,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:05:16,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:05:16,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641289645] [2019-12-07 11:05:16,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:05:16,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-12-07 11:05:16,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172512896] [2019-12-07 11:05:16,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-07 11:05:16,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:05:16,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-07 11:05:16,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=589, Unknown=0, NotChecked=0, Total=650 [2019-12-07 11:05:16,303 INFO L87 Difference]: Start difference. First operand 23223 states and 69103 transitions. Second operand 26 states. [2019-12-07 11:05:19,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:05:19,884 INFO L93 Difference]: Finished difference Result 30525 states and 90189 transitions. [2019-12-07 11:05:19,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-12-07 11:05:19,885 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 72 [2019-12-07 11:05:19,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:05:19,922 INFO L225 Difference]: With dead ends: 30525 [2019-12-07 11:05:19,922 INFO L226 Difference]: Without dead ends: 28055 [2019-12-07 11:05:19,923 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 755 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=363, Invalid=3059, Unknown=0, NotChecked=0, Total=3422 [2019-12-07 11:05:20,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28055 states. [2019-12-07 11:05:20,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28055 to 23855. [2019-12-07 11:05:20,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23855 states. [2019-12-07 11:05:20,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23855 states to 23855 states and 70933 transitions. [2019-12-07 11:05:20,265 INFO L78 Accepts]: Start accepts. Automaton has 23855 states and 70933 transitions. Word has length 72 [2019-12-07 11:05:20,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:05:20,265 INFO L462 AbstractCegarLoop]: Abstraction has 23855 states and 70933 transitions. [2019-12-07 11:05:20,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-07 11:05:20,266 INFO L276 IsEmpty]: Start isEmpty. Operand 23855 states and 70933 transitions. [2019-12-07 11:05:20,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:05:20,286 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:05:20,286 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:05:20,286 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:05:20,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:05:20,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1527218387, now seen corresponding path program 22 times [2019-12-07 11:05:20,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:05:20,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002719262] [2019-12-07 11:05:20,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:05:20,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:05:20,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:05:20,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002719262] [2019-12-07 11:05:20,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:05:20,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 11:05:20,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248769266] [2019-12-07 11:05:20,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 11:05:20,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:05:20,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 11:05:20,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-12-07 11:05:20,460 INFO L87 Difference]: Start difference. First operand 23855 states and 70933 transitions. Second operand 13 states. [2019-12-07 11:05:22,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:05:22,352 INFO L93 Difference]: Finished difference Result 33534 states and 99728 transitions. [2019-12-07 11:05:22,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 11:05:22,353 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 72 [2019-12-07 11:05:22,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:05:22,397 INFO L225 Difference]: With dead ends: 33534 [2019-12-07 11:05:22,397 INFO L226 Difference]: Without dead ends: 28295 [2019-12-07 11:05:22,397 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2019-12-07 11:05:22,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28295 states. [2019-12-07 11:05:22,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28295 to 23671. [2019-12-07 11:05:22,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23671 states. [2019-12-07 11:05:22,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23671 states to 23671 states and 70330 transitions. [2019-12-07 11:05:22,751 INFO L78 Accepts]: Start accepts. Automaton has 23671 states and 70330 transitions. Word has length 72 [2019-12-07 11:05:22,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:05:22,751 INFO L462 AbstractCegarLoop]: Abstraction has 23671 states and 70330 transitions. [2019-12-07 11:05:22,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 11:05:22,751 INFO L276 IsEmpty]: Start isEmpty. Operand 23671 states and 70330 transitions. [2019-12-07 11:05:22,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:05:22,772 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:05:22,772 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:05:22,772 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:05:22,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:05:22,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1219459465, now seen corresponding path program 23 times [2019-12-07 11:05:22,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:05:22,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684074287] [2019-12-07 11:05:22,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:05:22,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:05:23,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:05:23,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684074287] [2019-12-07 11:05:23,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:05:23,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-07 11:05:23,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947571740] [2019-12-07 11:05:23,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 11:05:23,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:05:23,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 11:05:23,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2019-12-07 11:05:23,123 INFO L87 Difference]: Start difference. First operand 23671 states and 70330 transitions. Second operand 17 states. [2019-12-07 11:05:26,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:05:26,661 INFO L93 Difference]: Finished difference Result 37096 states and 111555 transitions. [2019-12-07 11:05:26,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-07 11:05:26,661 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 72 [2019-12-07 11:05:26,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:05:26,713 INFO L225 Difference]: With dead ends: 37096 [2019-12-07 11:05:26,713 INFO L226 Difference]: Without dead ends: 35652 [2019-12-07 11:05:26,714 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=296, Invalid=2154, Unknown=0, NotChecked=0, Total=2450 [2019-12-07 11:05:26,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35652 states. [2019-12-07 11:05:27,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35652 to 30850. [2019-12-07 11:05:27,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30850 states. [2019-12-07 11:05:27,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30850 states to 30850 states and 93178 transitions. [2019-12-07 11:05:27,184 INFO L78 Accepts]: Start accepts. Automaton has 30850 states and 93178 transitions. Word has length 72 [2019-12-07 11:05:27,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:05:27,185 INFO L462 AbstractCegarLoop]: Abstraction has 30850 states and 93178 transitions. [2019-12-07 11:05:27,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 11:05:27,185 INFO L276 IsEmpty]: Start isEmpty. Operand 30850 states and 93178 transitions. [2019-12-07 11:05:27,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:05:27,215 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:05:27,215 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:05:27,215 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:05:27,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:05:27,215 INFO L82 PathProgramCache]: Analyzing trace with hash 92504751, now seen corresponding path program 24 times [2019-12-07 11:05:27,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:05:27,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078239716] [2019-12-07 11:05:27,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:05:27,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:05:27,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:05:27,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078239716] [2019-12-07 11:05:27,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:05:27,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-07 11:05:27,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401450449] [2019-12-07 11:05:27,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 11:05:27,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:05:27,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 11:05:27,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-12-07 11:05:27,588 INFO L87 Difference]: Start difference. First operand 30850 states and 93178 transitions. Second operand 17 states. [2019-12-07 11:05:29,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:05:29,719 INFO L93 Difference]: Finished difference Result 35035 states and 104636 transitions. [2019-12-07 11:05:29,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-07 11:05:29,719 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 72 [2019-12-07 11:05:29,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:05:29,755 INFO L225 Difference]: With dead ends: 35035 [2019-12-07 11:05:29,755 INFO L226 Difference]: Without dead ends: 30666 [2019-12-07 11:05:29,756 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=296, Invalid=1960, Unknown=0, NotChecked=0, Total=2256 [2019-12-07 11:05:29,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30666 states. [2019-12-07 11:05:30,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30666 to 25761. [2019-12-07 11:05:30,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25761 states. [2019-12-07 11:05:30,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25761 states to 25761 states and 76404 transitions. [2019-12-07 11:05:30,148 INFO L78 Accepts]: Start accepts. Automaton has 25761 states and 76404 transitions. Word has length 72 [2019-12-07 11:05:30,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:05:30,148 INFO L462 AbstractCegarLoop]: Abstraction has 25761 states and 76404 transitions. [2019-12-07 11:05:30,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 11:05:30,148 INFO L276 IsEmpty]: Start isEmpty. Operand 25761 states and 76404 transitions. [2019-12-07 11:05:30,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:05:30,173 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:05:30,173 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:05:30,173 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:05:30,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:05:30,174 INFO L82 PathProgramCache]: Analyzing trace with hash -412588411, now seen corresponding path program 25 times [2019-12-07 11:05:30,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:05:30,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339862231] [2019-12-07 11:05:30,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:05:30,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:05:31,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:05:31,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339862231] [2019-12-07 11:05:31,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:05:31,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-12-07 11:05:31,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502441142] [2019-12-07 11:05:31,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-07 11:05:31,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:05:31,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-07 11:05:31,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=636, Unknown=0, NotChecked=0, Total=702 [2019-12-07 11:05:31,170 INFO L87 Difference]: Start difference. First operand 25761 states and 76404 transitions. Second operand 27 states. [2019-12-07 11:05:43,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:05:43,160 INFO L93 Difference]: Finished difference Result 33475 states and 97666 transitions. [2019-12-07 11:05:43,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-12-07 11:05:43,161 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 72 [2019-12-07 11:05:43,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:05:43,201 INFO L225 Difference]: With dead ends: 33475 [2019-12-07 11:05:43,201 INFO L226 Difference]: Without dead ends: 32750 [2019-12-07 11:05:43,202 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 4 SyntacticMatches, 9 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1775 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=669, Invalid=6137, Unknown=0, NotChecked=0, Total=6806 [2019-12-07 11:05:43,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32750 states. [2019-12-07 11:05:43,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32750 to 26957. [2019-12-07 11:05:43,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26957 states. [2019-12-07 11:05:43,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26957 states to 26957 states and 79657 transitions. [2019-12-07 11:05:43,636 INFO L78 Accepts]: Start accepts. Automaton has 26957 states and 79657 transitions. Word has length 72 [2019-12-07 11:05:43,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:05:43,636 INFO L462 AbstractCegarLoop]: Abstraction has 26957 states and 79657 transitions. [2019-12-07 11:05:43,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-07 11:05:43,636 INFO L276 IsEmpty]: Start isEmpty. Operand 26957 states and 79657 transitions. [2019-12-07 11:05:43,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:05:43,663 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:05:43,663 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:05:43,663 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:05:43,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:05:43,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1618834681, now seen corresponding path program 26 times [2019-12-07 11:05:43,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:05:43,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310936024] [2019-12-07 11:05:43,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:05:43,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:05:44,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:05:44,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310936024] [2019-12-07 11:05:44,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:05:44,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-12-07 11:05:44,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763738577] [2019-12-07 11:05:44,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-07 11:05:44,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:05:44,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-07 11:05:44,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=634, Unknown=0, NotChecked=0, Total=702 [2019-12-07 11:05:44,751 INFO L87 Difference]: Start difference. First operand 26957 states and 79657 transitions. Second operand 27 states. [2019-12-07 11:05:57,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:05:57,943 INFO L93 Difference]: Finished difference Result 50414 states and 146912 transitions. [2019-12-07 11:05:57,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-12-07 11:05:57,943 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 72 [2019-12-07 11:05:57,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:05:58,006 INFO L225 Difference]: With dead ends: 50414 [2019-12-07 11:05:58,006 INFO L226 Difference]: Without dead ends: 45936 [2019-12-07 11:05:58,007 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2106 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=771, Invalid=6885, Unknown=0, NotChecked=0, Total=7656 [2019-12-07 11:05:58,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45936 states. [2019-12-07 11:05:58,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45936 to 30906. [2019-12-07 11:05:58,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30906 states. [2019-12-07 11:05:58,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30906 states to 30906 states and 90864 transitions. [2019-12-07 11:05:58,545 INFO L78 Accepts]: Start accepts. Automaton has 30906 states and 90864 transitions. Word has length 72 [2019-12-07 11:05:58,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:05:58,545 INFO L462 AbstractCegarLoop]: Abstraction has 30906 states and 90864 transitions. [2019-12-07 11:05:58,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-07 11:05:58,545 INFO L276 IsEmpty]: Start isEmpty. Operand 30906 states and 90864 transitions. [2019-12-07 11:05:58,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:05:58,574 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:05:58,574 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:05:58,574 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:05:58,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:05:58,574 INFO L82 PathProgramCache]: Analyzing trace with hash -775810087, now seen corresponding path program 27 times [2019-12-07 11:05:58,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:05:58,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180235362] [2019-12-07 11:05:58,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:05:58,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:05:59,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:05:59,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180235362] [2019-12-07 11:05:59,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:05:59,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2019-12-07 11:05:59,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057226437] [2019-12-07 11:05:59,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-12-07 11:05:59,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:05:59,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-12-07 11:05:59,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=847, Unknown=0, NotChecked=0, Total=930 [2019-12-07 11:05:59,539 INFO L87 Difference]: Start difference. First operand 30906 states and 90864 transitions. Second operand 31 states. [2019-12-07 11:06:20,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:06:20,250 INFO L93 Difference]: Finished difference Result 53243 states and 154650 transitions. [2019-12-07 11:06:20,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-12-07 11:06:20,251 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 72 [2019-12-07 11:06:20,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:06:20,306 INFO L225 Difference]: With dead ends: 53243 [2019-12-07 11:06:20,306 INFO L226 Difference]: Without dead ends: 46064 [2019-12-07 11:06:20,307 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3776 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=1160, Invalid=11722, Unknown=0, NotChecked=0, Total=12882 [2019-12-07 11:06:20,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46064 states. [2019-12-07 11:06:20,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46064 to 36329. [2019-12-07 11:06:20,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36329 states. [2019-12-07 11:06:20,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36329 states to 36329 states and 105620 transitions. [2019-12-07 11:06:20,884 INFO L78 Accepts]: Start accepts. Automaton has 36329 states and 105620 transitions. Word has length 72 [2019-12-07 11:06:20,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:06:20,884 INFO L462 AbstractCegarLoop]: Abstraction has 36329 states and 105620 transitions. [2019-12-07 11:06:20,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-12-07 11:06:20,884 INFO L276 IsEmpty]: Start isEmpty. Operand 36329 states and 105620 transitions. [2019-12-07 11:06:20,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:06:20,918 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:06:20,918 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:06:20,918 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:06:20,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:06:20,918 INFO L82 PathProgramCache]: Analyzing trace with hash -2124717811, now seen corresponding path program 28 times [2019-12-07 11:06:20,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:06:20,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382732738] [2019-12-07 11:06:20,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:06:20,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:06:21,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:06:21,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382732738] [2019-12-07 11:06:21,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:06:21,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-07 11:06:21,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241209231] [2019-12-07 11:06:21,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 11:06:21,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:06:21,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 11:06:21,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-12-07 11:06:21,301 INFO L87 Difference]: Start difference. First operand 36329 states and 105620 transitions. Second operand 19 states. [2019-12-07 11:06:26,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:06:26,741 INFO L93 Difference]: Finished difference Result 46447 states and 133792 transitions. [2019-12-07 11:06:26,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-12-07 11:06:26,741 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 72 [2019-12-07 11:06:26,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:06:26,785 INFO L225 Difference]: With dead ends: 46447 [2019-12-07 11:06:26,786 INFO L226 Difference]: Without dead ends: 40049 [2019-12-07 11:06:26,786 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1266 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=488, Invalid=4204, Unknown=0, NotChecked=0, Total=4692 [2019-12-07 11:06:26,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40049 states. [2019-12-07 11:06:27,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40049 to 35559. [2019-12-07 11:06:27,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35559 states. [2019-12-07 11:06:27,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35559 states to 35559 states and 103572 transitions. [2019-12-07 11:06:27,294 INFO L78 Accepts]: Start accepts. Automaton has 35559 states and 103572 transitions. Word has length 72 [2019-12-07 11:06:27,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:06:27,294 INFO L462 AbstractCegarLoop]: Abstraction has 35559 states and 103572 transitions. [2019-12-07 11:06:27,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 11:06:27,294 INFO L276 IsEmpty]: Start isEmpty. Operand 35559 states and 103572 transitions. [2019-12-07 11:06:27,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:06:27,409 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:06:27,409 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:06:27,409 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:06:27,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:06:27,410 INFO L82 PathProgramCache]: Analyzing trace with hash -1418023049, now seen corresponding path program 29 times [2019-12-07 11:06:27,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:06:27,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145664787] [2019-12-07 11:06:27,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:06:27,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:06:27,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:06:27,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145664787] [2019-12-07 11:06:27,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:06:27,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-07 11:06:27,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538671106] [2019-12-07 11:06:27,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-07 11:06:27,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:06:27,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-07 11:06:27,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2019-12-07 11:06:27,747 INFO L87 Difference]: Start difference. First operand 35559 states and 103572 transitions. Second operand 20 states. [2019-12-07 11:06:30,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:06:30,903 INFO L93 Difference]: Finished difference Result 39554 states and 114910 transitions. [2019-12-07 11:06:30,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-07 11:06:30,903 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 72 [2019-12-07 11:06:30,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:06:30,946 INFO L225 Difference]: With dead ends: 39554 [2019-12-07 11:06:30,946 INFO L226 Difference]: Without dead ends: 39334 [2019-12-07 11:06:30,946 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 634 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=306, Invalid=2556, Unknown=0, NotChecked=0, Total=2862 [2019-12-07 11:06:31,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39334 states. [2019-12-07 11:06:31,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39334 to 36140. [2019-12-07 11:06:31,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36140 states. [2019-12-07 11:06:31,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36140 states to 36140 states and 105231 transitions. [2019-12-07 11:06:31,451 INFO L78 Accepts]: Start accepts. Automaton has 36140 states and 105231 transitions. Word has length 72 [2019-12-07 11:06:31,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:06:31,451 INFO L462 AbstractCegarLoop]: Abstraction has 36140 states and 105231 transitions. [2019-12-07 11:06:31,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-07 11:06:31,452 INFO L276 IsEmpty]: Start isEmpty. Operand 36140 states and 105231 transitions. [2019-12-07 11:06:31,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:06:31,484 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:06:31,484 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:06:31,484 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:06:31,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:06:31,484 INFO L82 PathProgramCache]: Analyzing trace with hash -448342107, now seen corresponding path program 30 times [2019-12-07 11:06:31,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:06:31,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980671284] [2019-12-07 11:06:31,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:06:31,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:06:32,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:06:32,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980671284] [2019-12-07 11:06:32,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:06:32,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-12-07 11:06:32,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530554210] [2019-12-07 11:06:32,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-07 11:06:32,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:06:32,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-07 11:06:32,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=632, Unknown=0, NotChecked=0, Total=702 [2019-12-07 11:06:32,099 INFO L87 Difference]: Start difference. First operand 36140 states and 105231 transitions. Second operand 27 states. [2019-12-07 11:06:36,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:06:36,856 INFO L93 Difference]: Finished difference Result 40202 states and 116399 transitions. [2019-12-07 11:06:36,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-07 11:06:36,856 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 72 [2019-12-07 11:06:36,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:06:36,912 INFO L225 Difference]: With dead ends: 40202 [2019-12-07 11:06:36,912 INFO L226 Difference]: Without dead ends: 38898 [2019-12-07 11:06:36,913 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=290, Invalid=2680, Unknown=0, NotChecked=0, Total=2970 [2019-12-07 11:06:37,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38898 states. [2019-12-07 11:06:37,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38898 to 36274. [2019-12-07 11:06:37,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36274 states. [2019-12-07 11:06:37,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36274 states to 36274 states and 105608 transitions. [2019-12-07 11:06:37,408 INFO L78 Accepts]: Start accepts. Automaton has 36274 states and 105608 transitions. Word has length 72 [2019-12-07 11:06:37,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:06:37,409 INFO L462 AbstractCegarLoop]: Abstraction has 36274 states and 105608 transitions. [2019-12-07 11:06:37,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-07 11:06:37,409 INFO L276 IsEmpty]: Start isEmpty. Operand 36274 states and 105608 transitions. [2019-12-07 11:06:37,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:06:37,442 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:06:37,442 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:06:37,442 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:06:37,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:06:37,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1860287697, now seen corresponding path program 31 times [2019-12-07 11:06:37,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:06:37,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857595830] [2019-12-07 11:06:37,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:06:37,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:06:38,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:06:38,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857595830] [2019-12-07 11:06:38,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:06:38,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2019-12-07 11:06:38,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691470790] [2019-12-07 11:06:38,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-07 11:06:38,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:06:38,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-07 11:06:38,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=797, Unknown=0, NotChecked=0, Total=870 [2019-12-07 11:06:38,945 INFO L87 Difference]: Start difference. First operand 36274 states and 105608 transitions. Second operand 30 states. [2019-12-07 11:06:45,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:06:45,754 INFO L93 Difference]: Finished difference Result 53103 states and 153019 transitions. [2019-12-07 11:06:45,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-12-07 11:06:45,754 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 72 [2019-12-07 11:06:45,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:06:45,817 INFO L225 Difference]: With dead ends: 53103 [2019-12-07 11:06:45,817 INFO L226 Difference]: Without dead ends: 52031 [2019-12-07 11:06:45,818 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 5 SyntacticMatches, 6 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1053 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=427, Invalid=4403, Unknown=0, NotChecked=0, Total=4830 [2019-12-07 11:06:45,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52031 states. [2019-12-07 11:06:46,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52031 to 40970. [2019-12-07 11:06:46,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40970 states. [2019-12-07 11:06:46,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40970 states to 40970 states and 120146 transitions. [2019-12-07 11:06:46,476 INFO L78 Accepts]: Start accepts. Automaton has 40970 states and 120146 transitions. Word has length 72 [2019-12-07 11:06:46,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:06:46,476 INFO L462 AbstractCegarLoop]: Abstraction has 40970 states and 120146 transitions. [2019-12-07 11:06:46,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-07 11:06:46,476 INFO L276 IsEmpty]: Start isEmpty. Operand 40970 states and 120146 transitions. [2019-12-07 11:06:46,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:06:46,513 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:06:46,513 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:06:46,513 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:06:46,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:06:46,513 INFO L82 PathProgramCache]: Analyzing trace with hash -778290673, now seen corresponding path program 32 times [2019-12-07 11:06:46,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:06:46,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710906449] [2019-12-07 11:06:46,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:06:46,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:06:46,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:06:46,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710906449] [2019-12-07 11:06:46,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:06:46,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-07 11:06:46,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064774075] [2019-12-07 11:06:46,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 11:06:46,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:06:46,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 11:06:46,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-12-07 11:06:46,927 INFO L87 Difference]: Start difference. First operand 40970 states and 120146 transitions. Second operand 19 states. [2019-12-07 11:06:49,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:06:49,422 INFO L93 Difference]: Finished difference Result 44658 states and 130296 transitions. [2019-12-07 11:06:49,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-07 11:06:49,423 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 72 [2019-12-07 11:06:49,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:06:49,470 INFO L225 Difference]: With dead ends: 44658 [2019-12-07 11:06:49,470 INFO L226 Difference]: Without dead ends: 42441 [2019-12-07 11:06:49,471 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=307, Invalid=2143, Unknown=0, NotChecked=0, Total=2450 [2019-12-07 11:06:49,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42441 states. [2019-12-07 11:06:49,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42441 to 40161. [2019-12-07 11:06:49,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40161 states. [2019-12-07 11:06:50,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40161 states to 40161 states and 117801 transitions. [2019-12-07 11:06:50,030 INFO L78 Accepts]: Start accepts. Automaton has 40161 states and 117801 transitions. Word has length 72 [2019-12-07 11:06:50,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:06:50,030 INFO L462 AbstractCegarLoop]: Abstraction has 40161 states and 117801 transitions. [2019-12-07 11:06:50,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 11:06:50,030 INFO L276 IsEmpty]: Start isEmpty. Operand 40161 states and 117801 transitions. [2019-12-07 11:06:50,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:06:50,066 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:06:50,066 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:06:50,066 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:06:50,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:06:50,067 INFO L82 PathProgramCache]: Analyzing trace with hash 818986983, now seen corresponding path program 33 times [2019-12-07 11:06:50,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:06:50,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155262962] [2019-12-07 11:06:50,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:06:50,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:06:50,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:06:50,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155262962] [2019-12-07 11:06:50,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:06:50,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-07 11:06:50,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220938066] [2019-12-07 11:06:50,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 11:06:50,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:06:50,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 11:06:50,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-12-07 11:06:50,490 INFO L87 Difference]: Start difference. First operand 40161 states and 117801 transitions. Second operand 19 states. [2019-12-07 11:06:54,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:06:54,869 INFO L93 Difference]: Finished difference Result 44126 states and 128804 transitions. [2019-12-07 11:06:54,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-12-07 11:06:54,869 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 72 [2019-12-07 11:06:54,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:06:54,910 INFO L225 Difference]: With dead ends: 44126 [2019-12-07 11:06:54,911 INFO L226 Difference]: Without dead ends: 42346 [2019-12-07 11:06:54,911 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1012 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=422, Invalid=3484, Unknown=0, NotChecked=0, Total=3906 [2019-12-07 11:06:55,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42346 states. [2019-12-07 11:06:55,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42346 to 40105. [2019-12-07 11:06:55,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40105 states. [2019-12-07 11:06:55,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40105 states to 40105 states and 117641 transitions. [2019-12-07 11:06:55,441 INFO L78 Accepts]: Start accepts. Automaton has 40105 states and 117641 transitions. Word has length 72 [2019-12-07 11:06:55,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:06:55,441 INFO L462 AbstractCegarLoop]: Abstraction has 40105 states and 117641 transitions. [2019-12-07 11:06:55,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 11:06:55,441 INFO L276 IsEmpty]: Start isEmpty. Operand 40105 states and 117641 transitions. [2019-12-07 11:06:55,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:06:55,477 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:06:55,477 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:06:55,477 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:06:55,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:06:55,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1175429615, now seen corresponding path program 34 times [2019-12-07 11:06:55,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:06:55,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255180961] [2019-12-07 11:06:55,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:06:55,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:06:55,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:06:55,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255180961] [2019-12-07 11:06:55,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:06:55,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-07 11:06:55,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705837312] [2019-12-07 11:06:55,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 11:06:55,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:06:55,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 11:06:55,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-12-07 11:06:55,773 INFO L87 Difference]: Start difference. First operand 40105 states and 117641 transitions. Second operand 19 states. [2019-12-07 11:06:57,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:06:57,629 INFO L93 Difference]: Finished difference Result 43139 states and 126036 transitions. [2019-12-07 11:06:57,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-07 11:06:57,630 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 72 [2019-12-07 11:06:57,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:06:57,676 INFO L225 Difference]: With dead ends: 43139 [2019-12-07 11:06:57,676 INFO L226 Difference]: Without dead ends: 41915 [2019-12-07 11:06:57,677 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=281, Invalid=1881, Unknown=0, NotChecked=0, Total=2162 [2019-12-07 11:06:57,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41915 states. [2019-12-07 11:06:58,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41915 to 40113. [2019-12-07 11:06:58,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40113 states. [2019-12-07 11:06:58,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40113 states to 40113 states and 117661 transitions. [2019-12-07 11:06:58,228 INFO L78 Accepts]: Start accepts. Automaton has 40113 states and 117661 transitions. Word has length 72 [2019-12-07 11:06:58,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:06:58,229 INFO L462 AbstractCegarLoop]: Abstraction has 40113 states and 117661 transitions. [2019-12-07 11:06:58,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 11:06:58,229 INFO L276 IsEmpty]: Start isEmpty. Operand 40113 states and 117661 transitions. [2019-12-07 11:06:58,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:06:58,265 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:06:58,265 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:06:58,265 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:06:58,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:06:58,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1326041155, now seen corresponding path program 35 times [2019-12-07 11:06:58,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:06:58,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865942391] [2019-12-07 11:06:58,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:06:58,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:06:58,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:06:58,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865942391] [2019-12-07 11:06:58,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:06:58,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-07 11:06:58,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891634644] [2019-12-07 11:06:58,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-07 11:06:58,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:06:58,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-07 11:06:58,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2019-12-07 11:06:58,679 INFO L87 Difference]: Start difference. First operand 40113 states and 117661 transitions. Second operand 23 states. [2019-12-07 11:07:02,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:02,016 INFO L93 Difference]: Finished difference Result 66976 states and 197399 transitions. [2019-12-07 11:07:02,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-07 11:07:02,016 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 72 [2019-12-07 11:07:02,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:02,089 INFO L225 Difference]: With dead ends: 66976 [2019-12-07 11:07:02,089 INFO L226 Difference]: Without dead ends: 54962 [2019-12-07 11:07:02,089 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 761 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=335, Invalid=2745, Unknown=0, NotChecked=0, Total=3080 [2019-12-07 11:07:02,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54962 states. [2019-12-07 11:07:02,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54962 to 37116. [2019-12-07 11:07:02,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37116 states. [2019-12-07 11:07:02,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37116 states to 37116 states and 109021 transitions. [2019-12-07 11:07:02,715 INFO L78 Accepts]: Start accepts. Automaton has 37116 states and 109021 transitions. Word has length 72 [2019-12-07 11:07:02,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:02,715 INFO L462 AbstractCegarLoop]: Abstraction has 37116 states and 109021 transitions. [2019-12-07 11:07:02,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-07 11:07:02,715 INFO L276 IsEmpty]: Start isEmpty. Operand 37116 states and 109021 transitions. [2019-12-07 11:07:02,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:07:02,749 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:02,749 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:07:02,749 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:07:02,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:02,749 INFO L82 PathProgramCache]: Analyzing trace with hash 409742705, now seen corresponding path program 36 times [2019-12-07 11:07:02,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:07:02,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868475928] [2019-12-07 11:07:02,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:07:02,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:03,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:07:03,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868475928] [2019-12-07 11:07:03,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:07:03,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-07 11:07:03,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845651112] [2019-12-07 11:07:03,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 11:07:03,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:07:03,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 11:07:03,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-12-07 11:07:03,108 INFO L87 Difference]: Start difference. First operand 37116 states and 109021 transitions. Second operand 19 states. [2019-12-07 11:07:08,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:08,383 INFO L93 Difference]: Finished difference Result 39270 states and 114500 transitions. [2019-12-07 11:07:08,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-07 11:07:08,384 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 72 [2019-12-07 11:07:08,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:08,440 INFO L225 Difference]: With dead ends: 39270 [2019-12-07 11:07:08,440 INFO L226 Difference]: Without dead ends: 39114 [2019-12-07 11:07:08,440 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=307, Invalid=2243, Unknown=0, NotChecked=0, Total=2550 [2019-12-07 11:07:08,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39114 states. [2019-12-07 11:07:08,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39114 to 37060. [2019-12-07 11:07:08,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37060 states. [2019-12-07 11:07:08,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37060 states to 37060 states and 108867 transitions. [2019-12-07 11:07:08,960 INFO L78 Accepts]: Start accepts. Automaton has 37060 states and 108867 transitions. Word has length 72 [2019-12-07 11:07:08,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:08,961 INFO L462 AbstractCegarLoop]: Abstraction has 37060 states and 108867 transitions. [2019-12-07 11:07:08,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 11:07:08,961 INFO L276 IsEmpty]: Start isEmpty. Operand 37060 states and 108867 transitions. [2019-12-07 11:07:08,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:07:08,994 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:08,994 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:07:08,994 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:07:08,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:08,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1329577811, now seen corresponding path program 37 times [2019-12-07 11:07:08,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:07:08,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507622323] [2019-12-07 11:07:08,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:07:09,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:09,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:07:09,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507622323] [2019-12-07 11:07:09,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:07:09,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-07 11:07:09,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733322750] [2019-12-07 11:07:09,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 11:07:09,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:07:09,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 11:07:09,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2019-12-07 11:07:09,258 INFO L87 Difference]: Start difference. First operand 37060 states and 108867 transitions. Second operand 17 states. [2019-12-07 11:07:11,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:11,960 INFO L93 Difference]: Finished difference Result 43923 states and 127946 transitions. [2019-12-07 11:07:11,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-07 11:07:11,961 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 72 [2019-12-07 11:07:11,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:12,006 INFO L225 Difference]: With dead ends: 43923 [2019-12-07 11:07:12,007 INFO L226 Difference]: Without dead ends: 41607 [2019-12-07 11:07:12,007 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=264, Invalid=1806, Unknown=0, NotChecked=0, Total=2070 [2019-12-07 11:07:12,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41607 states. [2019-12-07 11:07:12,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41607 to 37051. [2019-12-07 11:07:12,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37051 states. [2019-12-07 11:07:12,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37051 states to 37051 states and 108944 transitions. [2019-12-07 11:07:12,551 INFO L78 Accepts]: Start accepts. Automaton has 37051 states and 108944 transitions. Word has length 72 [2019-12-07 11:07:12,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:12,551 INFO L462 AbstractCegarLoop]: Abstraction has 37051 states and 108944 transitions. [2019-12-07 11:07:12,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 11:07:12,551 INFO L276 IsEmpty]: Start isEmpty. Operand 37051 states and 108944 transitions. [2019-12-07 11:07:12,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:07:12,585 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:12,585 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:07:12,585 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:07:12,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:12,585 INFO L82 PathProgramCache]: Analyzing trace with hash -959306655, now seen corresponding path program 38 times [2019-12-07 11:07:12,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:07:12,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409671260] [2019-12-07 11:07:12,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:07:12,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:13,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:07:13,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409671260] [2019-12-07 11:07:13,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:07:13,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-12-07 11:07:13,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883580063] [2019-12-07 11:07:13,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-07 11:07:13,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:07:13,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-07 11:07:13,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2019-12-07 11:07:13,498 INFO L87 Difference]: Start difference. First operand 37051 states and 108944 transitions. Second operand 26 states. [2019-12-07 11:07:19,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:19,313 INFO L93 Difference]: Finished difference Result 39076 states and 114064 transitions. [2019-12-07 11:07:19,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-12-07 11:07:19,313 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 72 [2019-12-07 11:07:19,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:19,356 INFO L225 Difference]: With dead ends: 39076 [2019-12-07 11:07:19,356 INFO L226 Difference]: Without dead ends: 38658 [2019-12-07 11:07:19,357 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 928 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=521, Invalid=3769, Unknown=0, NotChecked=0, Total=4290 [2019-12-07 11:07:19,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38658 states. [2019-12-07 11:07:19,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38658 to 37053. [2019-12-07 11:07:19,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37053 states. [2019-12-07 11:07:19,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37053 states to 37053 states and 108950 transitions. [2019-12-07 11:07:19,883 INFO L78 Accepts]: Start accepts. Automaton has 37053 states and 108950 transitions. Word has length 72 [2019-12-07 11:07:19,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:19,883 INFO L462 AbstractCegarLoop]: Abstraction has 37053 states and 108950 transitions. [2019-12-07 11:07:19,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-07 11:07:19,883 INFO L276 IsEmpty]: Start isEmpty. Operand 37053 states and 108950 transitions. [2019-12-07 11:07:19,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:07:19,916 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:19,917 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:07:19,917 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:07:19,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:19,917 INFO L82 PathProgramCache]: Analyzing trace with hash -116411483, now seen corresponding path program 39 times [2019-12-07 11:07:19,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:07:19,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747424836] [2019-12-07 11:07:19,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:07:19,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:20,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:07:20,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747424836] [2019-12-07 11:07:20,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:07:20,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-07 11:07:20,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100175853] [2019-12-07 11:07:20,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-07 11:07:20,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:07:20,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-07 11:07:20,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2019-12-07 11:07:20,465 INFO L87 Difference]: Start difference. First operand 37053 states and 108950 transitions. Second operand 23 states. [2019-12-07 11:07:22,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:22,732 INFO L93 Difference]: Finished difference Result 49565 states and 145358 transitions. [2019-12-07 11:07:22,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-07 11:07:22,732 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 72 [2019-12-07 11:07:22,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:22,786 INFO L225 Difference]: With dead ends: 49565 [2019-12-07 11:07:22,786 INFO L226 Difference]: Without dead ends: 47621 [2019-12-07 11:07:22,787 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=238, Invalid=1742, Unknown=0, NotChecked=0, Total=1980 [2019-12-07 11:07:22,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47621 states. [2019-12-07 11:07:23,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47621 to 38174. [2019-12-07 11:07:23,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38174 states. [2019-12-07 11:07:23,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38174 states to 38174 states and 112279 transitions. [2019-12-07 11:07:23,351 INFO L78 Accepts]: Start accepts. Automaton has 38174 states and 112279 transitions. Word has length 72 [2019-12-07 11:07:23,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:23,351 INFO L462 AbstractCegarLoop]: Abstraction has 38174 states and 112279 transitions. [2019-12-07 11:07:23,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-07 11:07:23,352 INFO L276 IsEmpty]: Start isEmpty. Operand 38174 states and 112279 transitions. [2019-12-07 11:07:23,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:07:23,385 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:23,385 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:07:23,386 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:07:23,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:23,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1202538871, now seen corresponding path program 40 times [2019-12-07 11:07:23,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:07:23,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042621485] [2019-12-07 11:07:23,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:07:23,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:23,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:07:23,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042621485] [2019-12-07 11:07:23,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:07:23,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-07 11:07:23,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780372795] [2019-12-07 11:07:23,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 11:07:23,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:07:23,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 11:07:23,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-12-07 11:07:23,700 INFO L87 Difference]: Start difference. First operand 38174 states and 112279 transitions. Second operand 17 states. [2019-12-07 11:07:28,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:28,162 INFO L93 Difference]: Finished difference Result 47247 states and 139185 transitions. [2019-12-07 11:07:28,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-07 11:07:28,162 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 72 [2019-12-07 11:07:28,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:28,209 INFO L225 Difference]: With dead ends: 47247 [2019-12-07 11:07:28,209 INFO L226 Difference]: Without dead ends: 41963 [2019-12-07 11:07:28,209 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=238, Invalid=1484, Unknown=0, NotChecked=0, Total=1722 [2019-12-07 11:07:28,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41963 states. [2019-12-07 11:07:28,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41963 to 38248. [2019-12-07 11:07:28,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38248 states. [2019-12-07 11:07:28,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38248 states to 38248 states and 112410 transitions. [2019-12-07 11:07:28,749 INFO L78 Accepts]: Start accepts. Automaton has 38248 states and 112410 transitions. Word has length 72 [2019-12-07 11:07:28,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:28,750 INFO L462 AbstractCegarLoop]: Abstraction has 38248 states and 112410 transitions. [2019-12-07 11:07:28,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 11:07:28,750 INFO L276 IsEmpty]: Start isEmpty. Operand 38248 states and 112410 transitions. [2019-12-07 11:07:28,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:07:28,786 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:28,786 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:07:28,786 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:07:28,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:28,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1084039497, now seen corresponding path program 41 times [2019-12-07 11:07:28,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:07:28,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679054711] [2019-12-07 11:07:28,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:07:28,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:29,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:07:29,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679054711] [2019-12-07 11:07:29,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:07:29,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-07 11:07:29,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775451200] [2019-12-07 11:07:29,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-07 11:07:29,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:07:29,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-07 11:07:29,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=446, Unknown=0, NotChecked=0, Total=506 [2019-12-07 11:07:29,390 INFO L87 Difference]: Start difference. First operand 38248 states and 112410 transitions. Second operand 23 states. [2019-12-07 11:07:33,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:33,874 INFO L93 Difference]: Finished difference Result 45325 states and 131971 transitions. [2019-12-07 11:07:33,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-07 11:07:33,875 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 72 [2019-12-07 11:07:33,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:33,939 INFO L225 Difference]: With dead ends: 45325 [2019-12-07 11:07:33,939 INFO L226 Difference]: Without dead ends: 45217 [2019-12-07 11:07:33,939 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=247, Invalid=1915, Unknown=0, NotChecked=0, Total=2162 [2019-12-07 11:07:34,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45217 states. [2019-12-07 11:07:34,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45217 to 40686. [2019-12-07 11:07:34,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40686 states. [2019-12-07 11:07:34,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40686 states to 40686 states and 119713 transitions. [2019-12-07 11:07:34,569 INFO L78 Accepts]: Start accepts. Automaton has 40686 states and 119713 transitions. Word has length 72 [2019-12-07 11:07:34,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:34,569 INFO L462 AbstractCegarLoop]: Abstraction has 40686 states and 119713 transitions. [2019-12-07 11:07:34,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-07 11:07:34,570 INFO L276 IsEmpty]: Start isEmpty. Operand 40686 states and 119713 transitions. [2019-12-07 11:07:34,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:07:34,608 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:34,608 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:07:34,608 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:07:34,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:34,609 INFO L82 PathProgramCache]: Analyzing trace with hash 187287981, now seen corresponding path program 42 times [2019-12-07 11:07:34,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:07:34,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589137322] [2019-12-07 11:07:34,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:07:34,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:34,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:07:34,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589137322] [2019-12-07 11:07:34,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:07:34,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 11:07:34,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253977609] [2019-12-07 11:07:34,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 11:07:34,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:07:34,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 11:07:34,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2019-12-07 11:07:34,898 INFO L87 Difference]: Start difference. First operand 40686 states and 119713 transitions. Second operand 16 states. [2019-12-07 11:07:37,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:37,539 INFO L93 Difference]: Finished difference Result 45899 states and 134403 transitions. [2019-12-07 11:07:37,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-07 11:07:37,539 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 72 [2019-12-07 11:07:37,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:37,591 INFO L225 Difference]: With dead ends: 45899 [2019-12-07 11:07:37,591 INFO L226 Difference]: Without dead ends: 45663 [2019-12-07 11:07:37,591 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=756, Unknown=0, NotChecked=0, Total=870 [2019-12-07 11:07:37,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45663 states. [2019-12-07 11:07:38,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45663 to 41420. [2019-12-07 11:07:38,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41420 states. [2019-12-07 11:07:38,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41420 states to 41420 states and 121877 transitions. [2019-12-07 11:07:38,174 INFO L78 Accepts]: Start accepts. Automaton has 41420 states and 121877 transitions. Word has length 72 [2019-12-07 11:07:38,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:38,175 INFO L462 AbstractCegarLoop]: Abstraction has 41420 states and 121877 transitions. [2019-12-07 11:07:38,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 11:07:38,175 INFO L276 IsEmpty]: Start isEmpty. Operand 41420 states and 121877 transitions. [2019-12-07 11:07:38,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:07:38,214 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:38,214 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:07:38,214 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:07:38,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:38,214 INFO L82 PathProgramCache]: Analyzing trace with hash 11600885, now seen corresponding path program 43 times [2019-12-07 11:07:38,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:07:38,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304743329] [2019-12-07 11:07:38,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:07:38,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:38,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:07:38,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304743329] [2019-12-07 11:07:38,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:07:38,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 11:07:38,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153980092] [2019-12-07 11:07:38,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 11:07:38,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:07:38,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 11:07:38,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2019-12-07 11:07:38,443 INFO L87 Difference]: Start difference. First operand 41420 states and 121877 transitions. Second operand 15 states. [2019-12-07 11:07:42,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:42,182 INFO L93 Difference]: Finished difference Result 48866 states and 143321 transitions. [2019-12-07 11:07:42,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-07 11:07:42,182 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2019-12-07 11:07:42,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:42,236 INFO L225 Difference]: With dead ends: 48866 [2019-12-07 11:07:42,236 INFO L226 Difference]: Without dead ends: 46270 [2019-12-07 11:07:42,236 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=177, Invalid=1013, Unknown=0, NotChecked=0, Total=1190 [2019-12-07 11:07:42,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46270 states. [2019-12-07 11:07:42,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46270 to 40547. [2019-12-07 11:07:42,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40547 states. [2019-12-07 11:07:42,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40547 states to 40547 states and 119386 transitions. [2019-12-07 11:07:42,828 INFO L78 Accepts]: Start accepts. Automaton has 40547 states and 119386 transitions. Word has length 72 [2019-12-07 11:07:42,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:42,828 INFO L462 AbstractCegarLoop]: Abstraction has 40547 states and 119386 transitions. [2019-12-07 11:07:42,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 11:07:42,828 INFO L276 IsEmpty]: Start isEmpty. Operand 40547 states and 119386 transitions. [2019-12-07 11:07:42,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:07:42,866 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:42,866 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:07:42,866 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:07:42,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:42,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1199512099, now seen corresponding path program 44 times [2019-12-07 11:07:42,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:07:42,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976273892] [2019-12-07 11:07:42,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:07:42,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:43,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:07:43,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976273892] [2019-12-07 11:07:43,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:07:43,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-07 11:07:43,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686304798] [2019-12-07 11:07:43,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 11:07:43,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:07:43,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 11:07:43,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2019-12-07 11:07:43,203 INFO L87 Difference]: Start difference. First operand 40547 states and 119386 transitions. Second operand 17 states. [2019-12-07 11:07:47,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:47,351 INFO L93 Difference]: Finished difference Result 46464 states and 136362 transitions. [2019-12-07 11:07:47,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-07 11:07:47,351 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 72 [2019-12-07 11:07:47,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:47,404 INFO L225 Difference]: With dead ends: 46464 [2019-12-07 11:07:47,404 INFO L226 Difference]: Without dead ends: 46260 [2019-12-07 11:07:47,404 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=186, Invalid=1146, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 11:07:47,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46260 states. [2019-12-07 11:07:48,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46260 to 42190. [2019-12-07 11:07:48,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42190 states. [2019-12-07 11:07:48,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42190 states to 42190 states and 124456 transitions. [2019-12-07 11:07:48,064 INFO L78 Accepts]: Start accepts. Automaton has 42190 states and 124456 transitions. Word has length 72 [2019-12-07 11:07:48,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:48,064 INFO L462 AbstractCegarLoop]: Abstraction has 42190 states and 124456 transitions. [2019-12-07 11:07:48,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 11:07:48,064 INFO L276 IsEmpty]: Start isEmpty. Operand 42190 states and 124456 transitions. [2019-12-07 11:07:48,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:07:48,100 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:48,101 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:07:48,101 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:07:48,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:48,101 INFO L82 PathProgramCache]: Analyzing trace with hash -643626137, now seen corresponding path program 45 times [2019-12-07 11:07:48,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:07:48,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136387428] [2019-12-07 11:07:48,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:07:48,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:48,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:07:48,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136387428] [2019-12-07 11:07:48,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:07:48,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-07 11:07:48,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618708330] [2019-12-07 11:07:48,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 11:07:48,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:07:48,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 11:07:48,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-12-07 11:07:48,395 INFO L87 Difference]: Start difference. First operand 42190 states and 124456 transitions. Second operand 17 states. [2019-12-07 11:07:51,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:07:51,586 INFO L93 Difference]: Finished difference Result 46817 states and 136953 transitions. [2019-12-07 11:07:51,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-07 11:07:51,587 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 72 [2019-12-07 11:07:51,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:07:51,651 INFO L225 Difference]: With dead ends: 46817 [2019-12-07 11:07:51,651 INFO L226 Difference]: Without dead ends: 45561 [2019-12-07 11:07:51,652 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=179, Invalid=1081, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 11:07:51,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45561 states. [2019-12-07 11:07:52,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45561 to 40823. [2019-12-07 11:07:52,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40823 states. [2019-12-07 11:07:52,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40823 states to 40823 states and 120040 transitions. [2019-12-07 11:07:52,248 INFO L78 Accepts]: Start accepts. Automaton has 40823 states and 120040 transitions. Word has length 72 [2019-12-07 11:07:52,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:07:52,248 INFO L462 AbstractCegarLoop]: Abstraction has 40823 states and 120040 transitions. [2019-12-07 11:07:52,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 11:07:52,249 INFO L276 IsEmpty]: Start isEmpty. Operand 40823 states and 120040 transitions. [2019-12-07 11:07:52,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:07:52,286 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:07:52,286 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:07:52,287 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:07:52,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:07:52,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1089087959, now seen corresponding path program 46 times [2019-12-07 11:07:52,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:07:52,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801335056] [2019-12-07 11:07:52,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:07:52,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:07:53,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:07:53,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801335056] [2019-12-07 11:07:53,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:07:53,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-12-07 11:07:53,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532512513] [2019-12-07 11:07:53,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-07 11:07:53,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:07:53,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-07 11:07:53,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2019-12-07 11:07:53,651 INFO L87 Difference]: Start difference. First operand 40823 states and 120040 transitions. Second operand 27 states. [2019-12-07 11:08:03,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:08:03,187 INFO L93 Difference]: Finished difference Result 42413 states and 124065 transitions. [2019-12-07 11:08:03,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-12-07 11:08:03,187 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 72 [2019-12-07 11:08:03,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:08:03,236 INFO L225 Difference]: With dead ends: 42413 [2019-12-07 11:08:03,236 INFO L226 Difference]: Without dead ends: 42393 [2019-12-07 11:08:03,236 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 4 SyntacticMatches, 6 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1091 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=545, Invalid=4567, Unknown=0, NotChecked=0, Total=5112 [2019-12-07 11:08:03,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42393 states. [2019-12-07 11:08:03,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42393 to 41007. [2019-12-07 11:08:03,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41007 states. [2019-12-07 11:08:03,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41007 states to 41007 states and 120471 transitions. [2019-12-07 11:08:03,802 INFO L78 Accepts]: Start accepts. Automaton has 41007 states and 120471 transitions. Word has length 72 [2019-12-07 11:08:03,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:08:03,803 INFO L462 AbstractCegarLoop]: Abstraction has 41007 states and 120471 transitions. [2019-12-07 11:08:03,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-07 11:08:03,803 INFO L276 IsEmpty]: Start isEmpty. Operand 41007 states and 120471 transitions. [2019-12-07 11:08:03,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:08:03,841 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:08:03,841 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:08:03,841 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:08:03,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:08:03,841 INFO L82 PathProgramCache]: Analyzing trace with hash 179068713, now seen corresponding path program 47 times [2019-12-07 11:08:03,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:08:03,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663269815] [2019-12-07 11:08:03,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:08:03,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:08:04,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:08:04,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663269815] [2019-12-07 11:08:04,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:08:04,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 11:08:04,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045426294] [2019-12-07 11:08:04,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 11:08:04,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:08:04,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 11:08:04,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2019-12-07 11:08:04,167 INFO L87 Difference]: Start difference. First operand 41007 states and 120471 transitions. Second operand 16 states. [2019-12-07 11:08:08,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:08:08,087 INFO L93 Difference]: Finished difference Result 49862 states and 146982 transitions. [2019-12-07 11:08:08,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-07 11:08:08,088 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 72 [2019-12-07 11:08:08,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:08:08,164 INFO L225 Difference]: With dead ends: 49862 [2019-12-07 11:08:08,165 INFO L226 Difference]: Without dead ends: 49644 [2019-12-07 11:08:08,165 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=187, Invalid=1073, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 11:08:08,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49644 states. [2019-12-07 11:08:08,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49644 to 40744. [2019-12-07 11:08:08,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40744 states. [2019-12-07 11:08:08,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40744 states to 40744 states and 119889 transitions. [2019-12-07 11:08:08,799 INFO L78 Accepts]: Start accepts. Automaton has 40744 states and 119889 transitions. Word has length 72 [2019-12-07 11:08:08,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:08:08,799 INFO L462 AbstractCegarLoop]: Abstraction has 40744 states and 119889 transitions. [2019-12-07 11:08:08,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 11:08:08,799 INFO L276 IsEmpty]: Start isEmpty. Operand 40744 states and 119889 transitions. [2019-12-07 11:08:08,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:08:08,839 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:08:08,839 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:08:08,839 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:08:08,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:08:08,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1118171809, now seen corresponding path program 48 times [2019-12-07 11:08:08,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:08:08,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782411193] [2019-12-07 11:08:08,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:08:08,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:08:09,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:08:09,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782411193] [2019-12-07 11:08:09,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:08:09,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-07 11:08:09,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354503800] [2019-12-07 11:08:09,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 11:08:09,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:08:09,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 11:08:09,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-12-07 11:08:09,139 INFO L87 Difference]: Start difference. First operand 40744 states and 119889 transitions. Second operand 17 states. [2019-12-07 11:08:12,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:08:12,201 INFO L93 Difference]: Finished difference Result 45967 states and 133746 transitions. [2019-12-07 11:08:12,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-07 11:08:12,202 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 72 [2019-12-07 11:08:12,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:08:12,262 INFO L225 Difference]: With dead ends: 45967 [2019-12-07 11:08:12,262 INFO L226 Difference]: Without dead ends: 45190 [2019-12-07 11:08:12,262 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=196, Invalid=1210, Unknown=0, NotChecked=0, Total=1406 [2019-12-07 11:08:12,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45190 states. [2019-12-07 11:08:12,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45190 to 40104. [2019-12-07 11:08:12,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40104 states. [2019-12-07 11:08:12,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40104 states to 40104 states and 118114 transitions. [2019-12-07 11:08:12,860 INFO L78 Accepts]: Start accepts. Automaton has 40104 states and 118114 transitions. Word has length 72 [2019-12-07 11:08:12,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:08:12,860 INFO L462 AbstractCegarLoop]: Abstraction has 40104 states and 118114 transitions. [2019-12-07 11:08:12,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 11:08:12,860 INFO L276 IsEmpty]: Start isEmpty. Operand 40104 states and 118114 transitions. [2019-12-07 11:08:12,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:08:12,899 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:08:12,899 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:08:12,899 INFO L410 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:08:12,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:08:12,899 INFO L82 PathProgramCache]: Analyzing trace with hash 140439999, now seen corresponding path program 49 times [2019-12-07 11:08:12,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:08:12,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051434305] [2019-12-07 11:08:12,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:08:12,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:08:14,359 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 25 [2019-12-07 11:08:14,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:08:14,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051434305] [2019-12-07 11:08:14,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:08:14,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-12-07 11:08:14,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265406968] [2019-12-07 11:08:14,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-07 11:08:14,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:08:14,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-07 11:08:14,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=688, Unknown=0, NotChecked=0, Total=756 [2019-12-07 11:08:14,981 INFO L87 Difference]: Start difference. First operand 40104 states and 118114 transitions. Second operand 28 states. [2019-12-07 11:08:20,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:08:20,414 INFO L93 Difference]: Finished difference Result 41987 states and 122997 transitions. [2019-12-07 11:08:20,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-07 11:08:20,414 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 72 [2019-12-07 11:08:20,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:08:20,461 INFO L225 Difference]: With dead ends: 41987 [2019-12-07 11:08:20,461 INFO L226 Difference]: Without dead ends: 41569 [2019-12-07 11:08:20,461 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=314, Invalid=2656, Unknown=0, NotChecked=0, Total=2970 [2019-12-07 11:08:20,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41569 states. [2019-12-07 11:08:20,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41569 to 40109. [2019-12-07 11:08:20,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40109 states. [2019-12-07 11:08:20,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40109 states to 40109 states and 118128 transitions. [2019-12-07 11:08:20,997 INFO L78 Accepts]: Start accepts. Automaton has 40109 states and 118128 transitions. Word has length 72 [2019-12-07 11:08:20,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:08:20,997 INFO L462 AbstractCegarLoop]: Abstraction has 40109 states and 118128 transitions. [2019-12-07 11:08:20,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-07 11:08:20,997 INFO L276 IsEmpty]: Start isEmpty. Operand 40109 states and 118128 transitions. [2019-12-07 11:08:21,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:08:21,033 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:08:21,034 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:08:21,034 INFO L410 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:08:21,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:08:21,034 INFO L82 PathProgramCache]: Analyzing trace with hash 2119557665, now seen corresponding path program 50 times [2019-12-07 11:08:21,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:08:21,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169865672] [2019-12-07 11:08:21,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:08:21,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:08:22,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:08:22,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169865672] [2019-12-07 11:08:22,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:08:22,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-12-07 11:08:22,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358961429] [2019-12-07 11:08:22,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-07 11:08:22,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:08:22,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-07 11:08:22,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650 [2019-12-07 11:08:22,903 INFO L87 Difference]: Start difference. First operand 40109 states and 118128 transitions. Second operand 26 states. [2019-12-07 11:08:30,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:08:30,116 INFO L93 Difference]: Finished difference Result 48158 states and 141120 transitions. [2019-12-07 11:08:30,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-07 11:08:30,117 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 72 [2019-12-07 11:08:30,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:08:30,182 INFO L225 Difference]: With dead ends: 48158 [2019-12-07 11:08:30,182 INFO L226 Difference]: Without dead ends: 45898 [2019-12-07 11:08:30,182 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=358, Invalid=2948, Unknown=0, NotChecked=0, Total=3306 [2019-12-07 11:08:30,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45898 states. [2019-12-07 11:08:30,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45898 to 40476. [2019-12-07 11:08:30,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40476 states. [2019-12-07 11:08:30,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40476 states to 40476 states and 119223 transitions. [2019-12-07 11:08:30,743 INFO L78 Accepts]: Start accepts. Automaton has 40476 states and 119223 transitions. Word has length 72 [2019-12-07 11:08:30,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:08:30,743 INFO L462 AbstractCegarLoop]: Abstraction has 40476 states and 119223 transitions. [2019-12-07 11:08:30,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-07 11:08:30,743 INFO L276 IsEmpty]: Start isEmpty. Operand 40476 states and 119223 transitions. [2019-12-07 11:08:30,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:08:30,780 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:08:30,780 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:08:30,780 INFO L410 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:08:30,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:08:30,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1033430277, now seen corresponding path program 51 times [2019-12-07 11:08:30,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:08:30,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923326004] [2019-12-07 11:08:30,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:08:30,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:08:31,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:08:31,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923326004] [2019-12-07 11:08:31,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:08:31,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-07 11:08:31,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370480684] [2019-12-07 11:08:31,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 11:08:31,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:08:31,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 11:08:31,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-12-07 11:08:31,136 INFO L87 Difference]: Start difference. First operand 40476 states and 119223 transitions. Second operand 18 states. [2019-12-07 11:08:35,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:08:35,079 INFO L93 Difference]: Finished difference Result 49848 states and 146468 transitions. [2019-12-07 11:08:35,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-07 11:08:35,080 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 72 [2019-12-07 11:08:35,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:08:35,129 INFO L225 Difference]: With dead ends: 49848 [2019-12-07 11:08:35,129 INFO L226 Difference]: Without dead ends: 43806 [2019-12-07 11:08:35,130 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=271, Invalid=1891, Unknown=0, NotChecked=0, Total=2162 [2019-12-07 11:08:35,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43806 states. [2019-12-07 11:08:35,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43806 to 40445. [2019-12-07 11:08:35,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40445 states. [2019-12-07 11:08:35,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40445 states to 40445 states and 119133 transitions. [2019-12-07 11:08:35,693 INFO L78 Accepts]: Start accepts. Automaton has 40445 states and 119133 transitions. Word has length 72 [2019-12-07 11:08:35,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:08:35,693 INFO L462 AbstractCegarLoop]: Abstraction has 40445 states and 119133 transitions. [2019-12-07 11:08:35,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 11:08:35,693 INFO L276 IsEmpty]: Start isEmpty. Operand 40445 states and 119133 transitions. [2019-12-07 11:08:35,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:08:35,729 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:08:35,730 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:08:35,730 INFO L410 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:08:35,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:08:35,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1623794057, now seen corresponding path program 52 times [2019-12-07 11:08:35,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:08:35,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578440742] [2019-12-07 11:08:35,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:08:35,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:08:36,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:08:36,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578440742] [2019-12-07 11:08:36,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:08:36,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-07 11:08:36,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978964686] [2019-12-07 11:08:36,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-07 11:08:36,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:08:36,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-07 11:08:36,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2019-12-07 11:08:36,187 INFO L87 Difference]: Start difference. First operand 40445 states and 119133 transitions. Second operand 23 states. [2019-12-07 11:08:38,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:08:38,124 INFO L93 Difference]: Finished difference Result 54953 states and 161122 transitions. [2019-12-07 11:08:38,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-07 11:08:38,124 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 72 [2019-12-07 11:08:38,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:08:38,190 INFO L225 Difference]: With dead ends: 54953 [2019-12-07 11:08:38,190 INFO L226 Difference]: Without dead ends: 52377 [2019-12-07 11:08:38,191 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=192, Invalid=1530, Unknown=0, NotChecked=0, Total=1722 [2019-12-07 11:08:38,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52377 states. [2019-12-07 11:08:38,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52377 to 40631. [2019-12-07 11:08:38,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40631 states. [2019-12-07 11:08:38,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40631 states to 40631 states and 119744 transitions. [2019-12-07 11:08:38,828 INFO L78 Accepts]: Start accepts. Automaton has 40631 states and 119744 transitions. Word has length 72 [2019-12-07 11:08:38,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:08:38,828 INFO L462 AbstractCegarLoop]: Abstraction has 40631 states and 119744 transitions. [2019-12-07 11:08:38,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-07 11:08:38,829 INFO L276 IsEmpty]: Start isEmpty. Operand 40631 states and 119744 transitions. [2019-12-07 11:08:38,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:08:38,865 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:08:38,865 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:08:38,865 INFO L410 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:08:38,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:08:38,866 INFO L82 PathProgramCache]: Analyzing trace with hash 810220657, now seen corresponding path program 53 times [2019-12-07 11:08:38,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:08:38,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608531446] [2019-12-07 11:08:38,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:08:38,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:08:39,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:08:39,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608531446] [2019-12-07 11:08:39,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:08:39,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 11:08:39,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358542137] [2019-12-07 11:08:39,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 11:08:39,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:08:39,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 11:08:39,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-12-07 11:08:39,057 INFO L87 Difference]: Start difference. First operand 40631 states and 119744 transitions. Second operand 13 states. [2019-12-07 11:08:39,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:08:39,930 INFO L93 Difference]: Finished difference Result 48551 states and 142379 transitions. [2019-12-07 11:08:39,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 11:08:39,930 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 72 [2019-12-07 11:08:39,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:08:39,983 INFO L225 Difference]: With dead ends: 48551 [2019-12-07 11:08:39,983 INFO L226 Difference]: Without dead ends: 46043 [2019-12-07 11:08:39,984 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=581, Unknown=0, NotChecked=0, Total=702 [2019-12-07 11:08:40,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46043 states. [2019-12-07 11:08:40,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46043 to 40964. [2019-12-07 11:08:40,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40964 states. [2019-12-07 11:08:40,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40964 states to 40964 states and 120769 transitions. [2019-12-07 11:08:40,572 INFO L78 Accepts]: Start accepts. Automaton has 40964 states and 120769 transitions. Word has length 72 [2019-12-07 11:08:40,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:08:40,572 INFO L462 AbstractCegarLoop]: Abstraction has 40964 states and 120769 transitions. [2019-12-07 11:08:40,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 11:08:40,572 INFO L276 IsEmpty]: Start isEmpty. Operand 40964 states and 120769 transitions. [2019-12-07 11:08:40,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:08:40,607 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:08:40,607 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:08:40,607 INFO L410 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:08:40,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:08:40,607 INFO L82 PathProgramCache]: Analyzing trace with hash 192578859, now seen corresponding path program 54 times [2019-12-07 11:08:40,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:08:40,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704686833] [2019-12-07 11:08:40,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:08:40,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:08:40,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:08:40,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704686833] [2019-12-07 11:08:40,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:08:40,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-07 11:08:40,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209420848] [2019-12-07 11:08:40,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 11:08:40,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:08:40,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 11:08:40,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-12-07 11:08:40,979 INFO L87 Difference]: Start difference. First operand 40964 states and 120769 transitions. Second operand 19 states. [2019-12-07 11:08:43,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:08:43,204 INFO L93 Difference]: Finished difference Result 46738 states and 137835 transitions. [2019-12-07 11:08:43,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 11:08:43,205 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 72 [2019-12-07 11:08:43,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:08:43,271 INFO L225 Difference]: With dead ends: 46738 [2019-12-07 11:08:43,271 INFO L226 Difference]: Without dead ends: 46646 [2019-12-07 11:08:43,271 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=819, Unknown=0, NotChecked=0, Total=930 [2019-12-07 11:08:43,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46646 states. [2019-12-07 11:08:43,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46646 to 42331. [2019-12-07 11:08:43,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42331 states. [2019-12-07 11:08:43,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42331 states to 42331 states and 124990 transitions. [2019-12-07 11:08:43,873 INFO L78 Accepts]: Start accepts. Automaton has 42331 states and 124990 transitions. Word has length 72 [2019-12-07 11:08:43,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:08:43,873 INFO L462 AbstractCegarLoop]: Abstraction has 42331 states and 124990 transitions. [2019-12-07 11:08:43,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 11:08:43,873 INFO L276 IsEmpty]: Start isEmpty. Operand 42331 states and 124990 transitions. [2019-12-07 11:08:43,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:08:43,912 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:08:43,913 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:08:43,913 INFO L410 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:08:43,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:08:43,913 INFO L82 PathProgramCache]: Analyzing trace with hash -275296065, now seen corresponding path program 55 times [2019-12-07 11:08:43,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:08:43,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282660492] [2019-12-07 11:08:43,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:08:43,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:08:44,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:08:44,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282660492] [2019-12-07 11:08:44,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:08:44,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 11:08:44,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147119289] [2019-12-07 11:08:44,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 11:08:44,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:08:44,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 11:08:44,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-12-07 11:08:44,134 INFO L87 Difference]: Start difference. First operand 42331 states and 124990 transitions. Second operand 15 states. [2019-12-07 11:08:45,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:08:45,909 INFO L93 Difference]: Finished difference Result 46578 states and 136266 transitions. [2019-12-07 11:08:45,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-07 11:08:45,909 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2019-12-07 11:08:45,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:08:45,961 INFO L225 Difference]: With dead ends: 46578 [2019-12-07 11:08:45,961 INFO L226 Difference]: Without dead ends: 46048 [2019-12-07 11:08:45,962 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=164, Invalid=892, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 11:08:46,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46048 states. [2019-12-07 11:08:46,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46048 to 41991. [2019-12-07 11:08:46,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41991 states. [2019-12-07 11:08:46,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41991 states to 41991 states and 123999 transitions. [2019-12-07 11:08:46,533 INFO L78 Accepts]: Start accepts. Automaton has 41991 states and 123999 transitions. Word has length 72 [2019-12-07 11:08:46,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:08:46,533 INFO L462 AbstractCegarLoop]: Abstraction has 41991 states and 123999 transitions. [2019-12-07 11:08:46,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 11:08:46,533 INFO L276 IsEmpty]: Start isEmpty. Operand 41991 states and 123999 transitions. [2019-12-07 11:08:46,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:08:46,570 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:08:46,571 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:08:46,571 INFO L410 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:08:46,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:08:46,571 INFO L82 PathProgramCache]: Analyzing trace with hash 21898027, now seen corresponding path program 56 times [2019-12-07 11:08:46,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:08:46,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500361890] [2019-12-07 11:08:46,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:08:46,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:08:47,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:08:47,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500361890] [2019-12-07 11:08:47,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:08:47,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-12-07 11:08:47,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141984824] [2019-12-07 11:08:47,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-07 11:08:47,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:08:47,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-07 11:08:47,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2019-12-07 11:08:47,177 INFO L87 Difference]: Start difference. First operand 41991 states and 123999 transitions. Second operand 26 states. [2019-12-07 11:08:50,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:08:50,448 INFO L93 Difference]: Finished difference Result 58726 states and 172398 transitions. [2019-12-07 11:08:50,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-07 11:08:50,448 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 72 [2019-12-07 11:08:50,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:08:50,510 INFO L225 Difference]: With dead ends: 58726 [2019-12-07 11:08:50,510 INFO L226 Difference]: Without dead ends: 50036 [2019-12-07 11:08:50,511 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=356, Invalid=3066, Unknown=0, NotChecked=0, Total=3422 [2019-12-07 11:08:50,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50036 states. [2019-12-07 11:08:51,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50036 to 40197. [2019-12-07 11:08:51,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40197 states. [2019-12-07 11:08:51,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40197 states to 40197 states and 118608 transitions. [2019-12-07 11:08:51,138 INFO L78 Accepts]: Start accepts. Automaton has 40197 states and 118608 transitions. Word has length 72 [2019-12-07 11:08:51,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:08:51,138 INFO L462 AbstractCegarLoop]: Abstraction has 40197 states and 118608 transitions. [2019-12-07 11:08:51,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-07 11:08:51,139 INFO L276 IsEmpty]: Start isEmpty. Operand 40197 states and 118608 transitions. [2019-12-07 11:08:51,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:08:51,175 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:08:51,176 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:08:51,176 INFO L410 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:08:51,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:08:51,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1297925903, now seen corresponding path program 57 times [2019-12-07 11:08:51,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:08:51,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757723467] [2019-12-07 11:08:51,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:08:51,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:08:51,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:08:51,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757723467] [2019-12-07 11:08:51,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:08:51,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-12-07 11:08:51,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988817011] [2019-12-07 11:08:51,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-07 11:08:51,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:08:51,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-07 11:08:51,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=492, Unknown=0, NotChecked=0, Total=552 [2019-12-07 11:08:51,680 INFO L87 Difference]: Start difference. First operand 40197 states and 118608 transitions. Second operand 24 states. [2019-12-07 11:08:54,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:08:54,874 INFO L93 Difference]: Finished difference Result 53081 states and 155928 transitions. [2019-12-07 11:08:54,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-07 11:08:54,874 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 72 [2019-12-07 11:08:54,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:08:54,939 INFO L225 Difference]: With dead ends: 53081 [2019-12-07 11:08:54,939 INFO L226 Difference]: Without dead ends: 50969 [2019-12-07 11:08:54,939 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=269, Invalid=2181, Unknown=0, NotChecked=0, Total=2450 [2019-12-07 11:08:55,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50969 states. [2019-12-07 11:08:55,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50969 to 40287. [2019-12-07 11:08:55,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40287 states. [2019-12-07 11:08:55,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40287 states to 40287 states and 118905 transitions. [2019-12-07 11:08:55,555 INFO L78 Accepts]: Start accepts. Automaton has 40287 states and 118905 transitions. Word has length 72 [2019-12-07 11:08:55,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:08:55,555 INFO L462 AbstractCegarLoop]: Abstraction has 40287 states and 118905 transitions. [2019-12-07 11:08:55,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-07 11:08:55,555 INFO L276 IsEmpty]: Start isEmpty. Operand 40287 states and 118905 transitions. [2019-12-07 11:08:55,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:08:55,591 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:08:55,592 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:08:55,592 INFO L410 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:08:55,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:08:55,592 INFO L82 PathProgramCache]: Analyzing trace with hash 867471333, now seen corresponding path program 58 times [2019-12-07 11:08:55,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:08:55,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58350182] [2019-12-07 11:08:55,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:08:55,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:08:56,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:08:56,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58350182] [2019-12-07 11:08:56,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:08:56,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-12-07 11:08:56,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524506157] [2019-12-07 11:08:56,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-07 11:08:56,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:08:56,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-07 11:08:56,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=536, Unknown=0, NotChecked=0, Total=600 [2019-12-07 11:08:56,285 INFO L87 Difference]: Start difference. First operand 40287 states and 118905 transitions. Second operand 25 states. [2019-12-07 11:08:59,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:08:59,949 INFO L93 Difference]: Finished difference Result 62857 states and 185700 transitions. [2019-12-07 11:08:59,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-12-07 11:08:59,949 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 72 [2019-12-07 11:08:59,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:09:00,021 INFO L225 Difference]: With dead ends: 62857 [2019-12-07 11:09:00,021 INFO L226 Difference]: Without dead ends: 57232 [2019-12-07 11:09:00,021 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 911 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=415, Invalid=3367, Unknown=0, NotChecked=0, Total=3782 [2019-12-07 11:09:00,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57232 states. [2019-12-07 11:09:00,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57232 to 46673. [2019-12-07 11:09:00,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46673 states. [2019-12-07 11:09:00,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46673 states to 46673 states and 137898 transitions. [2019-12-07 11:09:00,750 INFO L78 Accepts]: Start accepts. Automaton has 46673 states and 137898 transitions. Word has length 72 [2019-12-07 11:09:00,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:09:00,750 INFO L462 AbstractCegarLoop]: Abstraction has 46673 states and 137898 transitions. [2019-12-07 11:09:00,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-07 11:09:00,750 INFO L276 IsEmpty]: Start isEmpty. Operand 46673 states and 137898 transitions. [2019-12-07 11:09:00,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:09:00,792 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:09:00,793 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:09:00,793 INFO L410 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:09:00,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:09:00,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1595227909, now seen corresponding path program 59 times [2019-12-07 11:09:00,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:09:00,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685097618] [2019-12-07 11:09:00,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:09:00,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:09:01,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:09:01,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685097618] [2019-12-07 11:09:01,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:09:01,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 11:09:01,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210395873] [2019-12-07 11:09:01,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 11:09:01,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:09:01,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 11:09:01,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-12-07 11:09:01,003 INFO L87 Difference]: Start difference. First operand 46673 states and 137898 transitions. Second operand 16 states. [2019-12-07 11:09:02,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:09:02,840 INFO L93 Difference]: Finished difference Result 54561 states and 160641 transitions. [2019-12-07 11:09:02,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-07 11:09:02,841 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 72 [2019-12-07 11:09:02,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:09:02,917 INFO L225 Difference]: With dead ends: 54561 [2019-12-07 11:09:02,918 INFO L226 Difference]: Without dead ends: 50674 [2019-12-07 11:09:02,918 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=177, Invalid=1083, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 11:09:03,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50674 states. [2019-12-07 11:09:03,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50674 to 46399. [2019-12-07 11:09:03,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46399 states. [2019-12-07 11:09:03,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46399 states to 46399 states and 137061 transitions. [2019-12-07 11:09:03,568 INFO L78 Accepts]: Start accepts. Automaton has 46399 states and 137061 transitions. Word has length 72 [2019-12-07 11:09:03,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:09:03,569 INFO L462 AbstractCegarLoop]: Abstraction has 46399 states and 137061 transitions. [2019-12-07 11:09:03,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 11:09:03,569 INFO L276 IsEmpty]: Start isEmpty. Operand 46399 states and 137061 transitions. [2019-12-07 11:09:03,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:09:03,610 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:09:03,610 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:09:03,610 INFO L410 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:09:03,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:09:03,611 INFO L82 PathProgramCache]: Analyzing trace with hash -963955527, now seen corresponding path program 60 times [2019-12-07 11:09:03,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:09:03,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241410684] [2019-12-07 11:09:03,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:09:03,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:09:04,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:09:04,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241410684] [2019-12-07 11:09:04,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:09:04,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-07 11:09:04,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034355018] [2019-12-07 11:09:04,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-07 11:09:04,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:09:04,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-07 11:09:04,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2019-12-07 11:09:04,178 INFO L87 Difference]: Start difference. First operand 46399 states and 137061 transitions. Second operand 21 states. [2019-12-07 11:09:07,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:09:07,229 INFO L93 Difference]: Finished difference Result 52844 states and 155171 transitions. [2019-12-07 11:09:07,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-07 11:09:07,230 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 72 [2019-12-07 11:09:07,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:09:07,294 INFO L225 Difference]: With dead ends: 52844 [2019-12-07 11:09:07,294 INFO L226 Difference]: Without dead ends: 50932 [2019-12-07 11:09:07,294 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=256, Invalid=1636, Unknown=0, NotChecked=0, Total=1892 [2019-12-07 11:09:07,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50932 states. [2019-12-07 11:09:07,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50932 to 47736. [2019-12-07 11:09:07,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47736 states. [2019-12-07 11:09:07,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47736 states to 47736 states and 140781 transitions. [2019-12-07 11:09:07,947 INFO L78 Accepts]: Start accepts. Automaton has 47736 states and 140781 transitions. Word has length 72 [2019-12-07 11:09:07,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:09:07,947 INFO L462 AbstractCegarLoop]: Abstraction has 47736 states and 140781 transitions. [2019-12-07 11:09:07,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-07 11:09:07,947 INFO L276 IsEmpty]: Start isEmpty. Operand 47736 states and 140781 transitions. [2019-12-07 11:09:07,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:09:07,990 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:09:07,990 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:09:07,990 INFO L410 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:09:07,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:09:07,991 INFO L82 PathProgramCache]: Analyzing trace with hash 2067322597, now seen corresponding path program 61 times [2019-12-07 11:09:07,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:09:07,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320810588] [2019-12-07 11:09:07,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:09:08,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:09:08,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:09:08,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320810588] [2019-12-07 11:09:08,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:09:08,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-07 11:09:08,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976274392] [2019-12-07 11:09:08,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-07 11:09:08,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:09:08,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-07 11:09:08,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2019-12-07 11:09:08,372 INFO L87 Difference]: Start difference. First operand 47736 states and 140781 transitions. Second operand 20 states. [2019-12-07 11:09:10,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:09:10,149 INFO L93 Difference]: Finished difference Result 56618 states and 164821 transitions. [2019-12-07 11:09:10,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-07 11:09:10,150 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 72 [2019-12-07 11:09:10,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:09:10,221 INFO L225 Difference]: With dead ends: 56618 [2019-12-07 11:09:10,221 INFO L226 Difference]: Without dead ends: 54643 [2019-12-07 11:09:10,221 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=218, Invalid=1504, Unknown=0, NotChecked=0, Total=1722 [2019-12-07 11:09:10,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54643 states. [2019-12-07 11:09:10,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54643 to 48158. [2019-12-07 11:09:10,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48158 states. [2019-12-07 11:09:10,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48158 states to 48158 states and 142089 transitions. [2019-12-07 11:09:10,939 INFO L78 Accepts]: Start accepts. Automaton has 48158 states and 142089 transitions. Word has length 72 [2019-12-07 11:09:10,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:09:10,939 INFO L462 AbstractCegarLoop]: Abstraction has 48158 states and 142089 transitions. [2019-12-07 11:09:10,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-07 11:09:10,939 INFO L276 IsEmpty]: Start isEmpty. Operand 48158 states and 142089 transitions. [2019-12-07 11:09:10,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:09:10,982 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:09:10,982 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:09:10,982 INFO L410 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:09:10,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:09:10,983 INFO L82 PathProgramCache]: Analyzing trace with hash -790683081, now seen corresponding path program 62 times [2019-12-07 11:09:10,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:09:10,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830311037] [2019-12-07 11:09:10,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:09:11,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:09:11,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:09:11,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830311037] [2019-12-07 11:09:11,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:09:11,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-12-07 11:09:11,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271090143] [2019-12-07 11:09:11,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-07 11:09:11,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:09:11,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-07 11:09:11,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=581, Unknown=0, NotChecked=0, Total=650 [2019-12-07 11:09:11,833 INFO L87 Difference]: Start difference. First operand 48158 states and 142089 transitions. Second operand 26 states. [2019-12-07 11:09:20,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:09:20,903 INFO L93 Difference]: Finished difference Result 61671 states and 181111 transitions. [2019-12-07 11:09:20,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-12-07 11:09:20,903 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 72 [2019-12-07 11:09:20,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:09:20,974 INFO L225 Difference]: With dead ends: 61671 [2019-12-07 11:09:20,974 INFO L226 Difference]: Without dead ends: 55634 [2019-12-07 11:09:20,974 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1807 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=719, Invalid=5923, Unknown=0, NotChecked=0, Total=6642 [2019-12-07 11:09:21,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55634 states. [2019-12-07 11:09:21,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55634 to 49929. [2019-12-07 11:09:21,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49929 states. [2019-12-07 11:09:21,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49929 states to 49929 states and 146691 transitions. [2019-12-07 11:09:21,790 INFO L78 Accepts]: Start accepts. Automaton has 49929 states and 146691 transitions. Word has length 72 [2019-12-07 11:09:21,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:09:21,790 INFO L462 AbstractCegarLoop]: Abstraction has 49929 states and 146691 transitions. [2019-12-07 11:09:21,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-07 11:09:21,790 INFO L276 IsEmpty]: Start isEmpty. Operand 49929 states and 146691 transitions. [2019-12-07 11:09:21,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:09:21,845 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:09:21,846 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:09:21,846 INFO L410 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:09:21,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:09:21,846 INFO L82 PathProgramCache]: Analyzing trace with hash -137128791, now seen corresponding path program 63 times [2019-12-07 11:09:21,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:09:21,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598350469] [2019-12-07 11:09:21,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:09:21,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:09:23,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:09:23,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598350469] [2019-12-07 11:09:23,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:09:23,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-12-07 11:09:23,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249384832] [2019-12-07 11:09:23,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-07 11:09:23,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:09:23,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-07 11:09:23,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=580, Unknown=0, NotChecked=0, Total=650 [2019-12-07 11:09:23,344 INFO L87 Difference]: Start difference. First operand 49929 states and 146691 transitions. Second operand 26 states. [2019-12-07 11:09:29,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:09:29,545 INFO L93 Difference]: Finished difference Result 56125 states and 164445 transitions. [2019-12-07 11:09:29,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-07 11:09:29,546 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 72 [2019-12-07 11:09:29,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:09:29,626 INFO L225 Difference]: With dead ends: 56125 [2019-12-07 11:09:29,626 INFO L226 Difference]: Without dead ends: 55997 [2019-12-07 11:09:29,626 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=281, Invalid=2269, Unknown=0, NotChecked=0, Total=2550 [2019-12-07 11:09:29,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55997 states. [2019-12-07 11:09:30,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55997 to 53970. [2019-12-07 11:09:30,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53970 states. [2019-12-07 11:09:30,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53970 states to 53970 states and 158828 transitions. [2019-12-07 11:09:30,446 INFO L78 Accepts]: Start accepts. Automaton has 53970 states and 158828 transitions. Word has length 72 [2019-12-07 11:09:30,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:09:30,446 INFO L462 AbstractCegarLoop]: Abstraction has 53970 states and 158828 transitions. [2019-12-07 11:09:30,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-07 11:09:30,446 INFO L276 IsEmpty]: Start isEmpty. Operand 53970 states and 158828 transitions. [2019-12-07 11:09:30,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:09:30,505 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:09:30,505 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:09:30,505 INFO L410 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:09:30,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:09:30,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1717045655, now seen corresponding path program 64 times [2019-12-07 11:09:30,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:09:30,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836260756] [2019-12-07 11:09:30,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:09:30,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:09:31,198 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 31 [2019-12-07 11:09:31,376 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 29 [2019-12-07 11:09:31,562 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 31 [2019-12-07 11:09:33,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:09:33,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836260756] [2019-12-07 11:09:33,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:09:33,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2019-12-07 11:09:33,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191877457] [2019-12-07 11:09:33,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-12-07 11:09:33,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:09:33,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-12-07 11:09:33,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=977, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 11:09:33,859 INFO L87 Difference]: Start difference. First operand 53970 states and 158828 transitions. Second operand 33 states. [2019-12-07 11:09:40,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:09:40,620 INFO L93 Difference]: Finished difference Result 55386 states and 162459 transitions. [2019-12-07 11:09:40,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-07 11:09:40,620 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 72 [2019-12-07 11:09:40,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:09:40,690 INFO L225 Difference]: With dead ends: 55386 [2019-12-07 11:09:40,691 INFO L226 Difference]: Without dead ends: 55338 [2019-12-07 11:09:40,691 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 652 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=337, Invalid=3445, Unknown=0, NotChecked=0, Total=3782 [2019-12-07 11:09:40,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55338 states. [2019-12-07 11:09:41,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55338 to 54312. [2019-12-07 11:09:41,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54312 states. [2019-12-07 11:09:41,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54312 states to 54312 states and 159802 transitions. [2019-12-07 11:09:41,458 INFO L78 Accepts]: Start accepts. Automaton has 54312 states and 159802 transitions. Word has length 72 [2019-12-07 11:09:41,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:09:41,458 INFO L462 AbstractCegarLoop]: Abstraction has 54312 states and 159802 transitions. [2019-12-07 11:09:41,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-12-07 11:09:41,459 INFO L276 IsEmpty]: Start isEmpty. Operand 54312 states and 159802 transitions. [2019-12-07 11:09:41,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:09:41,518 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:09:41,518 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:09:41,518 INFO L410 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:09:41,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:09:41,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1721319897, now seen corresponding path program 65 times [2019-12-07 11:09:41,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:09:41,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876783247] [2019-12-07 11:09:41,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:09:41,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:09:41,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:09:41,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876783247] [2019-12-07 11:09:41,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:09:41,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-07 11:09:41,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169956429] [2019-12-07 11:09:41,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 11:09:41,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:09:41,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 11:09:41,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2019-12-07 11:09:41,859 INFO L87 Difference]: Start difference. First operand 54312 states and 159802 transitions. Second operand 18 states. [2019-12-07 11:09:43,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:09:43,927 INFO L93 Difference]: Finished difference Result 59881 states and 175699 transitions. [2019-12-07 11:09:43,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-07 11:09:43,928 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 72 [2019-12-07 11:09:43,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:09:44,003 INFO L225 Difference]: With dead ends: 59881 [2019-12-07 11:09:44,003 INFO L226 Difference]: Without dead ends: 59705 [2019-12-07 11:09:44,004 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=239, Invalid=1653, Unknown=0, NotChecked=0, Total=1892 [2019-12-07 11:09:44,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59705 states. [2019-12-07 11:09:44,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59705 to 53326. [2019-12-07 11:09:44,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53326 states. [2019-12-07 11:09:44,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53326 states to 53326 states and 156942 transitions. [2019-12-07 11:09:44,841 INFO L78 Accepts]: Start accepts. Automaton has 53326 states and 156942 transitions. Word has length 72 [2019-12-07 11:09:44,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:09:44,841 INFO L462 AbstractCegarLoop]: Abstraction has 53326 states and 156942 transitions. [2019-12-07 11:09:44,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 11:09:44,841 INFO L276 IsEmpty]: Start isEmpty. Operand 53326 states and 156942 transitions. [2019-12-07 11:09:44,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:09:44,900 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:09:44,900 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:09:44,900 INFO L410 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:09:44,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:09:44,901 INFO L82 PathProgramCache]: Analyzing trace with hash 764470559, now seen corresponding path program 66 times [2019-12-07 11:09:44,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:09:44,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129777924] [2019-12-07 11:09:44,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:09:44,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:09:45,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:09:45,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129777924] [2019-12-07 11:09:45,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:09:45,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-07 11:09:45,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733866425] [2019-12-07 11:09:45,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 11:09:45,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:09:45,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 11:09:45,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-12-07 11:09:45,242 INFO L87 Difference]: Start difference. First operand 53326 states and 156942 transitions. Second operand 18 states. [2019-12-07 11:09:47,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:09:47,389 INFO L93 Difference]: Finished difference Result 56810 states and 166304 transitions. [2019-12-07 11:09:47,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-07 11:09:47,389 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 72 [2019-12-07 11:09:47,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:09:47,459 INFO L225 Difference]: With dead ends: 56810 [2019-12-07 11:09:47,459 INFO L226 Difference]: Without dead ends: 55438 [2019-12-07 11:09:47,460 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=245, Invalid=1647, Unknown=0, NotChecked=0, Total=1892 [2019-12-07 11:09:47,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55438 states. [2019-12-07 11:09:48,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55438 to 53052. [2019-12-07 11:09:48,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53052 states. [2019-12-07 11:09:48,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53052 states to 53052 states and 156174 transitions. [2019-12-07 11:09:48,229 INFO L78 Accepts]: Start accepts. Automaton has 53052 states and 156174 transitions. Word has length 72 [2019-12-07 11:09:48,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:09:48,229 INFO L462 AbstractCegarLoop]: Abstraction has 53052 states and 156174 transitions. [2019-12-07 11:09:48,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 11:09:48,229 INFO L276 IsEmpty]: Start isEmpty. Operand 53052 states and 156174 transitions. [2019-12-07 11:09:48,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:09:48,287 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:09:48,287 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:09:48,288 INFO L410 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:09:48,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:09:48,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1136199517, now seen corresponding path program 67 times [2019-12-07 11:09:48,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:09:48,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403216101] [2019-12-07 11:09:48,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:09:48,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:09:48,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:09:48,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403216101] [2019-12-07 11:09:48,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:09:48,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 11:09:48,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259345201] [2019-12-07 11:09:48,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 11:09:48,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:09:48,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 11:09:48,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-12-07 11:09:48,448 INFO L87 Difference]: Start difference. First operand 53052 states and 156174 transitions. Second operand 14 states. [2019-12-07 11:09:49,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:09:49,753 INFO L93 Difference]: Finished difference Result 56548 states and 165264 transitions. [2019-12-07 11:09:49,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 11:09:49,753 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 72 [2019-12-07 11:09:49,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:09:49,826 INFO L225 Difference]: With dead ends: 56548 [2019-12-07 11:09:49,827 INFO L226 Difference]: Without dead ends: 56392 [2019-12-07 11:09:49,827 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=727, Unknown=0, NotChecked=0, Total=870 [2019-12-07 11:09:49,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56392 states. [2019-12-07 11:09:50,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56392 to 52912. [2019-12-07 11:09:50,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52912 states. [2019-12-07 11:09:50,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52912 states to 52912 states and 155793 transitions. [2019-12-07 11:09:50,581 INFO L78 Accepts]: Start accepts. Automaton has 52912 states and 155793 transitions. Word has length 72 [2019-12-07 11:09:50,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:09:50,582 INFO L462 AbstractCegarLoop]: Abstraction has 52912 states and 155793 transitions. [2019-12-07 11:09:50,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 11:09:50,582 INFO L276 IsEmpty]: Start isEmpty. Operand 52912 states and 155793 transitions. [2019-12-07 11:09:50,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:09:50,634 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:09:50,634 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:09:50,635 INFO L410 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:09:50,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:09:50,635 INFO L82 PathProgramCache]: Analyzing trace with hash 831775993, now seen corresponding path program 68 times [2019-12-07 11:09:50,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:09:50,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471972940] [2019-12-07 11:09:50,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:09:50,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:09:50,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:09:50,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471972940] [2019-12-07 11:09:50,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:09:50,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 11:09:50,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596627430] [2019-12-07 11:09:50,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 11:09:50,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:09:50,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 11:09:50,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2019-12-07 11:09:50,950 INFO L87 Difference]: Start difference. First operand 52912 states and 155793 transitions. Second operand 16 states. [2019-12-07 11:09:52,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:09:52,595 INFO L93 Difference]: Finished difference Result 60257 states and 176068 transitions. [2019-12-07 11:09:52,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-07 11:09:52,595 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 72 [2019-12-07 11:09:52,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:09:52,667 INFO L225 Difference]: With dead ends: 60257 [2019-12-07 11:09:52,667 INFO L226 Difference]: Without dead ends: 58621 [2019-12-07 11:09:52,668 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=184, Invalid=1006, Unknown=0, NotChecked=0, Total=1190 [2019-12-07 11:09:52,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58621 states. [2019-12-07 11:09:53,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58621 to 52466. [2019-12-07 11:09:53,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52466 states. [2019-12-07 11:09:53,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52466 states to 52466 states and 154286 transitions. [2019-12-07 11:09:53,459 INFO L78 Accepts]: Start accepts. Automaton has 52466 states and 154286 transitions. Word has length 72 [2019-12-07 11:09:53,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:09:53,460 INFO L462 AbstractCegarLoop]: Abstraction has 52466 states and 154286 transitions. [2019-12-07 11:09:53,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 11:09:53,460 INFO L276 IsEmpty]: Start isEmpty. Operand 52466 states and 154286 transitions. [2019-12-07 11:09:53,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:09:53,517 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:09:53,517 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:09:53,517 INFO L410 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:09:53,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:09:53,518 INFO L82 PathProgramCache]: Analyzing trace with hash -2115188337, now seen corresponding path program 69 times [2019-12-07 11:09:53,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:09:53,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590782296] [2019-12-07 11:09:53,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:09:53,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:09:54,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:09:54,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590782296] [2019-12-07 11:09:54,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:09:54,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-12-07 11:09:54,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88353683] [2019-12-07 11:09:54,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-07 11:09:54,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:09:54,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-07 11:09:54,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=683, Unknown=0, NotChecked=0, Total=756 [2019-12-07 11:09:54,940 INFO L87 Difference]: Start difference. First operand 52466 states and 154286 transitions. Second operand 28 states. [2019-12-07 11:10:12,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:10:12,835 INFO L93 Difference]: Finished difference Result 68518 states and 200059 transitions. [2019-12-07 11:10:12,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-12-07 11:10:12,836 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 72 [2019-12-07 11:10:12,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:10:12,931 INFO L225 Difference]: With dead ends: 68518 [2019-12-07 11:10:12,931 INFO L226 Difference]: Without dead ends: 65551 [2019-12-07 11:10:12,932 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3067 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=1101, Invalid=9201, Unknown=0, NotChecked=0, Total=10302 [2019-12-07 11:10:13,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65551 states. [2019-12-07 11:10:13,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65551 to 56593. [2019-12-07 11:10:13,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56593 states. [2019-12-07 11:10:13,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56593 states to 56593 states and 166753 transitions. [2019-12-07 11:10:13,884 INFO L78 Accepts]: Start accepts. Automaton has 56593 states and 166753 transitions. Word has length 72 [2019-12-07 11:10:13,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:10:13,884 INFO L462 AbstractCegarLoop]: Abstraction has 56593 states and 166753 transitions. [2019-12-07 11:10:13,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-07 11:10:13,884 INFO L276 IsEmpty]: Start isEmpty. Operand 56593 states and 166753 transitions. [2019-12-07 11:10:13,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:10:13,947 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:10:13,947 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:10:13,947 INFO L410 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:10:13,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:10:13,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1868459225, now seen corresponding path program 70 times [2019-12-07 11:10:13,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:10:13,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126231445] [2019-12-07 11:10:13,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:10:13,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:10:14,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:10:14,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126231445] [2019-12-07 11:10:14,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:10:14,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-07 11:10:14,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315996434] [2019-12-07 11:10:14,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 11:10:14,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:10:14,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 11:10:14,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-12-07 11:10:14,200 INFO L87 Difference]: Start difference. First operand 56593 states and 166753 transitions. Second operand 18 states. [2019-12-07 11:10:15,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:10:15,540 INFO L93 Difference]: Finished difference Result 59915 states and 174813 transitions. [2019-12-07 11:10:15,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-07 11:10:15,540 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 72 [2019-12-07 11:10:15,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:10:15,615 INFO L225 Difference]: With dead ends: 59915 [2019-12-07 11:10:15,615 INFO L226 Difference]: Without dead ends: 59583 [2019-12-07 11:10:15,616 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=979, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 11:10:15,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59583 states. [2019-12-07 11:10:16,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59583 to 56629. [2019-12-07 11:10:16,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56629 states. [2019-12-07 11:10:16,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56629 states to 56629 states and 166809 transitions. [2019-12-07 11:10:16,485 INFO L78 Accepts]: Start accepts. Automaton has 56629 states and 166809 transitions. Word has length 72 [2019-12-07 11:10:16,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:10:16,486 INFO L462 AbstractCegarLoop]: Abstraction has 56629 states and 166809 transitions. [2019-12-07 11:10:16,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 11:10:16,486 INFO L276 IsEmpty]: Start isEmpty. Operand 56629 states and 166809 transitions. [2019-12-07 11:10:16,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:10:16,549 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:10:16,549 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:10:16,549 INFO L410 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:10:16,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:10:16,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1511141711, now seen corresponding path program 71 times [2019-12-07 11:10:16,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:10:16,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737259065] [2019-12-07 11:10:16,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:10:16,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:10:16,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:10:16,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737259065] [2019-12-07 11:10:16,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:10:16,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 11:10:16,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127881969] [2019-12-07 11:10:16,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 11:10:16,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:10:16,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 11:10:16,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-07 11:10:16,692 INFO L87 Difference]: Start difference. First operand 56629 states and 166809 transitions. Second operand 12 states. [2019-12-07 11:10:17,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:10:17,352 INFO L93 Difference]: Finished difference Result 63549 states and 186365 transitions. [2019-12-07 11:10:17,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 11:10:17,352 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 72 [2019-12-07 11:10:17,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:10:17,430 INFO L225 Difference]: With dead ends: 63549 [2019-12-07 11:10:17,430 INFO L226 Difference]: Without dead ends: 61683 [2019-12-07 11:10:17,430 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=489, Unknown=0, NotChecked=0, Total=600 [2019-12-07 11:10:17,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61683 states. [2019-12-07 11:10:18,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61683 to 56775. [2019-12-07 11:10:18,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56775 states. [2019-12-07 11:10:18,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56775 states to 56775 states and 167136 transitions. [2019-12-07 11:10:18,215 INFO L78 Accepts]: Start accepts. Automaton has 56775 states and 167136 transitions. Word has length 72 [2019-12-07 11:10:18,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:10:18,215 INFO L462 AbstractCegarLoop]: Abstraction has 56775 states and 167136 transitions. [2019-12-07 11:10:18,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 11:10:18,215 INFO L276 IsEmpty]: Start isEmpty. Operand 56775 states and 167136 transitions. [2019-12-07 11:10:18,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:10:18,275 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:10:18,275 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:10:18,275 INFO L410 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:10:18,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:10:18,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1552027135, now seen corresponding path program 72 times [2019-12-07 11:10:18,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:10:18,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104133738] [2019-12-07 11:10:18,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:10:18,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:10:18,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:10:18,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104133738] [2019-12-07 11:10:18,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:10:18,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 11:10:18,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461437274] [2019-12-07 11:10:18,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 11:10:18,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:10:18,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 11:10:18,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2019-12-07 11:10:18,474 INFO L87 Difference]: Start difference. First operand 56775 states and 167136 transitions. Second operand 16 states. [2019-12-07 11:10:19,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:10:19,887 INFO L93 Difference]: Finished difference Result 60644 states and 177008 transitions. [2019-12-07 11:10:19,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-07 11:10:19,887 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 72 [2019-12-07 11:10:19,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:10:19,971 INFO L225 Difference]: With dead ends: 60644 [2019-12-07 11:10:19,971 INFO L226 Difference]: Without dead ends: 60596 [2019-12-07 11:10:19,972 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=156, Invalid=966, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 11:10:20,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60596 states. [2019-12-07 11:10:20,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60596 to 56752. [2019-12-07 11:10:20,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56752 states. [2019-12-07 11:10:20,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56752 states to 56752 states and 167105 transitions. [2019-12-07 11:10:20,786 INFO L78 Accepts]: Start accepts. Automaton has 56752 states and 167105 transitions. Word has length 72 [2019-12-07 11:10:20,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:10:20,787 INFO L462 AbstractCegarLoop]: Abstraction has 56752 states and 167105 transitions. [2019-12-07 11:10:20,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 11:10:20,787 INFO L276 IsEmpty]: Start isEmpty. Operand 56752 states and 167105 transitions. [2019-12-07 11:10:20,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:10:20,848 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:10:20,848 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:10:20,848 INFO L410 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:10:20,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:10:20,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1732953689, now seen corresponding path program 73 times [2019-12-07 11:10:20,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:10:20,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680959376] [2019-12-07 11:10:20,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:10:20,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:10:21,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:10:21,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680959376] [2019-12-07 11:10:21,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:10:21,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-07 11:10:21,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68776011] [2019-12-07 11:10:21,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 11:10:21,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:10:21,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 11:10:21,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-12-07 11:10:21,131 INFO L87 Difference]: Start difference. First operand 56752 states and 167105 transitions. Second operand 19 states. [2019-12-07 11:10:25,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:10:25,317 INFO L93 Difference]: Finished difference Result 61612 states and 179641 transitions. [2019-12-07 11:10:25,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-07 11:10:25,318 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 72 [2019-12-07 11:10:25,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:10:25,401 INFO L225 Difference]: With dead ends: 61612 [2019-12-07 11:10:25,402 INFO L226 Difference]: Without dead ends: 59748 [2019-12-07 11:10:25,402 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=283, Invalid=2069, Unknown=0, NotChecked=0, Total=2352 [2019-12-07 11:10:25,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59748 states. [2019-12-07 11:10:26,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59748 to 56757. [2019-12-07 11:10:26,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56757 states. [2019-12-07 11:10:26,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56757 states to 56757 states and 167070 transitions. [2019-12-07 11:10:26,292 INFO L78 Accepts]: Start accepts. Automaton has 56757 states and 167070 transitions. Word has length 72 [2019-12-07 11:10:26,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:10:26,293 INFO L462 AbstractCegarLoop]: Abstraction has 56757 states and 167070 transitions. [2019-12-07 11:10:26,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 11:10:26,293 INFO L276 IsEmpty]: Start isEmpty. Operand 56757 states and 167070 transitions. [2019-12-07 11:10:26,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:10:26,352 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:10:26,352 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:10:26,352 INFO L410 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:10:26,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:10:26,352 INFO L82 PathProgramCache]: Analyzing trace with hash 2090271203, now seen corresponding path program 74 times [2019-12-07 11:10:26,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:10:26,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451294114] [2019-12-07 11:10:26,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:10:26,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:10:26,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:10:26,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451294114] [2019-12-07 11:10:26,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:10:26,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-07 11:10:26,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611448212] [2019-12-07 11:10:26,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-07 11:10:26,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:10:26,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-07 11:10:26,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2019-12-07 11:10:26,782 INFO L87 Difference]: Start difference. First operand 56757 states and 167070 transitions. Second operand 23 states. [2019-12-07 11:10:30,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:10:30,061 INFO L93 Difference]: Finished difference Result 82869 states and 242555 transitions. [2019-12-07 11:10:30,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-07 11:10:30,061 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 72 [2019-12-07 11:10:30,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:10:30,164 INFO L225 Difference]: With dead ends: 82869 [2019-12-07 11:10:30,164 INFO L226 Difference]: Without dead ends: 81038 [2019-12-07 11:10:30,165 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=159, Invalid=1247, Unknown=0, NotChecked=0, Total=1406 [2019-12-07 11:10:30,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81038 states. [2019-12-07 11:10:31,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81038 to 58717. [2019-12-07 11:10:31,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58717 states. [2019-12-07 11:10:31,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58717 states to 58717 states and 172500 transitions. [2019-12-07 11:10:31,142 INFO L78 Accepts]: Start accepts. Automaton has 58717 states and 172500 transitions. Word has length 72 [2019-12-07 11:10:31,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:10:31,142 INFO L462 AbstractCegarLoop]: Abstraction has 58717 states and 172500 transitions. [2019-12-07 11:10:31,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-07 11:10:31,142 INFO L276 IsEmpty]: Start isEmpty. Operand 58717 states and 172500 transitions. [2019-12-07 11:10:31,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:10:31,205 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:10:31,205 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:10:31,205 INFO L410 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:10:31,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:10:31,205 INFO L82 PathProgramCache]: Analyzing trace with hash 858472753, now seen corresponding path program 75 times [2019-12-07 11:10:31,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:10:31,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354521876] [2019-12-07 11:10:31,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:10:31,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:10:31,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:10:31,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354521876] [2019-12-07 11:10:31,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:10:31,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-07 11:10:31,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667327174] [2019-12-07 11:10:31,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 11:10:31,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:10:31,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 11:10:31,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-12-07 11:10:31,489 INFO L87 Difference]: Start difference. First operand 58717 states and 172500 transitions. Second operand 19 states. [2019-12-07 11:10:32,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:10:32,963 INFO L93 Difference]: Finished difference Result 61454 states and 179237 transitions. [2019-12-07 11:10:32,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-07 11:10:32,963 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 72 [2019-12-07 11:10:32,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:10:33,039 INFO L225 Difference]: With dead ends: 61454 [2019-12-07 11:10:33,039 INFO L226 Difference]: Without dead ends: 61386 [2019-12-07 11:10:33,040 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=182, Invalid=1224, Unknown=0, NotChecked=0, Total=1406 [2019-12-07 11:10:33,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61386 states. [2019-12-07 11:10:33,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61386 to 58660. [2019-12-07 11:10:33,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58660 states. [2019-12-07 11:10:33,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58660 states to 58660 states and 172411 transitions. [2019-12-07 11:10:33,860 INFO L78 Accepts]: Start accepts. Automaton has 58660 states and 172411 transitions. Word has length 72 [2019-12-07 11:10:33,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:10:33,860 INFO L462 AbstractCegarLoop]: Abstraction has 58660 states and 172411 transitions. [2019-12-07 11:10:33,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 11:10:33,861 INFO L276 IsEmpty]: Start isEmpty. Operand 58660 states and 172411 transitions. [2019-12-07 11:10:33,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:10:33,923 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:10:33,923 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:10:33,923 INFO L410 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:10:33,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:10:33,924 INFO L82 PathProgramCache]: Analyzing trace with hash -2002346403, now seen corresponding path program 76 times [2019-12-07 11:10:33,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:10:33,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649345490] [2019-12-07 11:10:33,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:10:33,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:10: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. [2019-12-07 11:10:34,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649345490] [2019-12-07 11:10:34,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:10:34,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-07 11:10:34,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490307235] [2019-12-07 11:10:34,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-07 11:10:34,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:10:34,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-07 11:10:34,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2019-12-07 11:10:34,297 INFO L87 Difference]: Start difference. First operand 58660 states and 172411 transitions. Second operand 20 states. [2019-12-07 11:10:35,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:10:35,690 INFO L93 Difference]: Finished difference Result 75877 states and 221155 transitions. [2019-12-07 11:10:35,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-07 11:10:35,691 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 72 [2019-12-07 11:10:35,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:10:35,787 INFO L225 Difference]: With dead ends: 75877 [2019-12-07 11:10:35,787 INFO L226 Difference]: Without dead ends: 75712 [2019-12-07 11:10:35,787 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=995, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 11:10:35,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75712 states. [2019-12-07 11:10:36,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75712 to 61051. [2019-12-07 11:10:36,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61051 states. [2019-12-07 11:10:36,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61051 states to 61051 states and 179423 transitions. [2019-12-07 11:10:36,751 INFO L78 Accepts]: Start accepts. Automaton has 61051 states and 179423 transitions. Word has length 72 [2019-12-07 11:10:36,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:10:36,751 INFO L462 AbstractCegarLoop]: Abstraction has 61051 states and 179423 transitions. [2019-12-07 11:10:36,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-07 11:10:36,751 INFO L276 IsEmpty]: Start isEmpty. Operand 61051 states and 179423 transitions. [2019-12-07 11:10:36,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:10:36,818 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:10:36,818 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:10:36,818 INFO L410 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:10:36,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:10:36,819 INFO L82 PathProgramCache]: Analyzing trace with hash 740039261, now seen corresponding path program 77 times [2019-12-07 11:10:36,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:10:36,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779275341] [2019-12-07 11:10:36,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:10:36,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:10:37,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:10:37,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779275341] [2019-12-07 11:10:37,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:10:37,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-12-07 11:10:37,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540828735] [2019-12-07 11:10:37,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-07 11:10:37,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:10:37,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-07 11:10:37,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=624, Unknown=0, NotChecked=0, Total=702 [2019-12-07 11:10:37,751 INFO L87 Difference]: Start difference. First operand 61051 states and 179423 transitions. Second operand 27 states. [2019-12-07 11:10:41,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:10:41,637 INFO L93 Difference]: Finished difference Result 67606 states and 197329 transitions. [2019-12-07 11:10:41,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-07 11:10:41,637 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 72 [2019-12-07 11:10:41,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:10:41,736 INFO L225 Difference]: With dead ends: 67606 [2019-12-07 11:10:41,736 INFO L226 Difference]: Without dead ends: 67532 [2019-12-07 11:10:41,736 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 605 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=304, Invalid=2666, Unknown=0, NotChecked=0, Total=2970 [2019-12-07 11:10:41,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67532 states. [2019-12-07 11:10:42,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67532 to 62482. [2019-12-07 11:10:42,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62482 states. [2019-12-07 11:10:42,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62482 states to 62482 states and 183406 transitions. [2019-12-07 11:10:42,672 INFO L78 Accepts]: Start accepts. Automaton has 62482 states and 183406 transitions. Word has length 72 [2019-12-07 11:10:42,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:10:42,673 INFO L462 AbstractCegarLoop]: Abstraction has 62482 states and 183406 transitions. [2019-12-07 11:10:42,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-07 11:10:42,673 INFO L276 IsEmpty]: Start isEmpty. Operand 62482 states and 183406 transitions. [2019-12-07 11:10:42,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:10:42,740 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:10:42,740 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:10:42,740 INFO L410 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:10:42,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:10:42,741 INFO L82 PathProgramCache]: Analyzing trace with hash -169979985, now seen corresponding path program 78 times [2019-12-07 11:10:42,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:10:42,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851689836] [2019-12-07 11:10:42,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:10:42,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:10:43,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:10:43,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851689836] [2019-12-07 11:10:43,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:10:43,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-07 11:10:43,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964681797] [2019-12-07 11:10:43,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-07 11:10:43,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:10:43,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-07 11:10:43,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2019-12-07 11:10:43,555 INFO L87 Difference]: Start difference. First operand 62482 states and 183406 transitions. Second operand 23 states. [2019-12-07 11:10:46,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:10:46,473 INFO L93 Difference]: Finished difference Result 78362 states and 227991 transitions. [2019-12-07 11:10:46,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-07 11:10:46,473 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 72 [2019-12-07 11:10:46,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:10:46,570 INFO L225 Difference]: With dead ends: 78362 [2019-12-07 11:10:46,570 INFO L226 Difference]: Without dead ends: 78030 [2019-12-07 11:10:46,571 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=180, Invalid=1460, Unknown=0, NotChecked=0, Total=1640 [2019-12-07 11:10:46,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78030 states. [2019-12-07 11:10:47,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78030 to 64588. [2019-12-07 11:10:47,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64588 states. [2019-12-07 11:10:47,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64588 states to 64588 states and 189883 transitions. [2019-12-07 11:10:47,695 INFO L78 Accepts]: Start accepts. Automaton has 64588 states and 189883 transitions. Word has length 72 [2019-12-07 11:10:47,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:10:47,695 INFO L462 AbstractCegarLoop]: Abstraction has 64588 states and 189883 transitions. [2019-12-07 11:10:47,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-07 11:10:47,695 INFO L276 IsEmpty]: Start isEmpty. Operand 64588 states and 189883 transitions. [2019-12-07 11:10:47,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:10:47,757 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:10:47,757 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:10:47,757 INFO L410 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:10:47,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:10:47,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1202457591, now seen corresponding path program 79 times [2019-12-07 11:10:47,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:10:47,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950865277] [2019-12-07 11:10:47,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:10:47,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:10:48,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:10:48,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950865277] [2019-12-07 11:10:48,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:10:48,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-07 11:10:48,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178316472] [2019-12-07 11:10:48,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-07 11:10:48,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:10:48,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-07 11:10:48,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2019-12-07 11:10:48,365 INFO L87 Difference]: Start difference. First operand 64588 states and 189883 transitions. Second operand 23 states. [2019-12-07 11:10:51,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:10:51,021 INFO L93 Difference]: Finished difference Result 77882 states and 226739 transitions. [2019-12-07 11:10:51,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-07 11:10:51,021 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 72 [2019-12-07 11:10:51,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:10:51,117 INFO L225 Difference]: With dead ends: 77882 [2019-12-07 11:10:51,117 INFO L226 Difference]: Without dead ends: 77715 [2019-12-07 11:10:51,118 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=181, Invalid=1459, Unknown=0, NotChecked=0, Total=1640 [2019-12-07 11:10:51,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77715 states. [2019-12-07 11:10:51,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77715 to 63404. [2019-12-07 11:10:51,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63404 states. [2019-12-07 11:10:52,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63404 states to 63404 states and 186220 transitions. [2019-12-07 11:10:52,089 INFO L78 Accepts]: Start accepts. Automaton has 63404 states and 186220 transitions. Word has length 72 [2019-12-07 11:10:52,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:10:52,089 INFO L462 AbstractCegarLoop]: Abstraction has 63404 states and 186220 transitions. [2019-12-07 11:10:52,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-07 11:10:52,090 INFO L276 IsEmpty]: Start isEmpty. Operand 63404 states and 186220 transitions. [2019-12-07 11:10:52,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:10:52,158 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:10:52,158 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:10:52,158 INFO L410 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:10:52,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:10:52,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1111958541, now seen corresponding path program 80 times [2019-12-07 11:10:52,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:10:52,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790236870] [2019-12-07 11:10:52,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:10:52,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:10:52,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:10:52,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790236870] [2019-12-07 11:10:52,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:10:52,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-12-07 11:10:52,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476559035] [2019-12-07 11:10:52,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-07 11:10:52,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:10:52,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-07 11:10:52,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2019-12-07 11:10:52,552 INFO L87 Difference]: Start difference. First operand 63404 states and 186220 transitions. Second operand 22 states. [2019-12-07 11:10:56,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:10:56,365 INFO L93 Difference]: Finished difference Result 84935 states and 245357 transitions. [2019-12-07 11:10:56,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-07 11:10:56,366 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 72 [2019-12-07 11:10:56,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:10:56,477 INFO L225 Difference]: With dead ends: 84935 [2019-12-07 11:10:56,478 INFO L226 Difference]: Without dead ends: 81528 [2019-12-07 11:10:56,478 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=216, Invalid=1764, Unknown=0, NotChecked=0, Total=1980 [2019-12-07 11:10:56,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81528 states. [2019-12-07 11:10:57,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81528 to 63615. [2019-12-07 11:10:57,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63615 states. [2019-12-07 11:10:57,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63615 states to 63615 states and 186812 transitions. [2019-12-07 11:10:57,487 INFO L78 Accepts]: Start accepts. Automaton has 63615 states and 186812 transitions. Word has length 72 [2019-12-07 11:10:57,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:10:57,488 INFO L462 AbstractCegarLoop]: Abstraction has 63615 states and 186812 transitions. [2019-12-07 11:10:57,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-07 11:10:57,488 INFO L276 IsEmpty]: Start isEmpty. Operand 63615 states and 186812 transitions. [2019-12-07 11:10:57,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:10:57,555 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:10:57,555 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:10:57,555 INFO L410 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:10:57,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:10:57,556 INFO L82 PathProgramCache]: Analyzing trace with hash -80334179, now seen corresponding path program 81 times [2019-12-07 11:10:57,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:10:57,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822529702] [2019-12-07 11:10:57,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:10:57,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:10:58,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:10:58,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822529702] [2019-12-07 11:10:58,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:10:58,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-07 11:10:58,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204000282] [2019-12-07 11:10:58,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-07 11:10:58,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:10:58,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-07 11:10:58,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2019-12-07 11:10:58,065 INFO L87 Difference]: Start difference. First operand 63615 states and 186812 transitions. Second operand 23 states. [2019-12-07 11:10:59,628 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 25 [2019-12-07 11:11:00,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:11:00,214 INFO L93 Difference]: Finished difference Result 86892 states and 251691 transitions. [2019-12-07 11:11:00,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-07 11:11:00,215 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 72 [2019-12-07 11:11:00,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:11:00,330 INFO L225 Difference]: With dead ends: 86892 [2019-12-07 11:11:00,330 INFO L226 Difference]: Without dead ends: 86603 [2019-12-07 11:11:00,330 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=195, Invalid=1697, Unknown=0, NotChecked=0, Total=1892 [2019-12-07 11:11:00,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86603 states. [2019-12-07 11:11:01,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86603 to 67409. [2019-12-07 11:11:01,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67409 states. [2019-12-07 11:11:01,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67409 states to 67409 states and 198450 transitions. [2019-12-07 11:11:01,425 INFO L78 Accepts]: Start accepts. Automaton has 67409 states and 198450 transitions. Word has length 72 [2019-12-07 11:11:01,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:11:01,425 INFO L462 AbstractCegarLoop]: Abstraction has 67409 states and 198450 transitions. [2019-12-07 11:11:01,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-07 11:11:01,425 INFO L276 IsEmpty]: Start isEmpty. Operand 67409 states and 198450 transitions. [2019-12-07 11:11:01,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:11:01,496 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:11:01,497 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:11:01,497 INFO L410 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:11:01,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:11:01,497 INFO L82 PathProgramCache]: Analyzing trace with hash -990353425, now seen corresponding path program 82 times [2019-12-07 11:11:01,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:11:01,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625236252] [2019-12-07 11:11:01,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:11:01,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:11:01,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:11:01,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625236252] [2019-12-07 11:11:01,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:11:01,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-07 11:11:01,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503346807] [2019-12-07 11:11:01,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-07 11:11:01,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:11:01,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-07 11:11:01,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=451, Unknown=0, NotChecked=0, Total=506 [2019-12-07 11:11:01,952 INFO L87 Difference]: Start difference. First operand 67409 states and 198450 transitions. Second operand 23 states. [2019-12-07 11:11:06,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:11:06,325 INFO L93 Difference]: Finished difference Result 86238 states and 249854 transitions. [2019-12-07 11:11:06,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-07 11:11:06,325 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 72 [2019-12-07 11:11:06,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:11:06,438 INFO L225 Difference]: With dead ends: 86238 [2019-12-07 11:11:06,438 INFO L226 Difference]: Without dead ends: 86055 [2019-12-07 11:11:06,438 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=208, Invalid=1862, Unknown=0, NotChecked=0, Total=2070 [2019-12-07 11:11:06,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86055 states. [2019-12-07 11:11:07,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86055 to 68491. [2019-12-07 11:11:07,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68491 states. [2019-12-07 11:11:07,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68491 states to 68491 states and 201881 transitions. [2019-12-07 11:11:07,519 INFO L78 Accepts]: Start accepts. Automaton has 68491 states and 201881 transitions. Word has length 72 [2019-12-07 11:11:07,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:11:07,519 INFO L462 AbstractCegarLoop]: Abstraction has 68491 states and 201881 transitions. [2019-12-07 11:11:07,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-07 11:11:07,519 INFO L276 IsEmpty]: Start isEmpty. Operand 68491 states and 201881 transitions. [2019-12-07 11:11:07,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:11:07,593 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:11:07,593 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:11:07,593 INFO L410 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:11:07,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:11:07,593 INFO L82 PathProgramCache]: Analyzing trace with hash -2022831031, now seen corresponding path program 83 times [2019-12-07 11:11:07,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:11:07,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838186439] [2019-12-07 11:11:07,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:11:07,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:11:08,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:11:08,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838186439] [2019-12-07 11:11:08,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:11:08,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-07 11:11:08,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067662473] [2019-12-07 11:11:08,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-07 11:11:08,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:11:08,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-07 11:11:08,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2019-12-07 11:11:08,041 INFO L87 Difference]: Start difference. First operand 68491 states and 201881 transitions. Second operand 23 states. [2019-12-07 11:11:10,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:11:10,084 INFO L93 Difference]: Finished difference Result 86006 states and 249262 transitions. [2019-12-07 11:11:10,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-07 11:11:10,084 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 72 [2019-12-07 11:11:10,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:11:10,191 INFO L225 Difference]: With dead ends: 86006 [2019-12-07 11:11:10,191 INFO L226 Difference]: Without dead ends: 85818 [2019-12-07 11:11:10,192 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=209, Invalid=1861, Unknown=0, NotChecked=0, Total=2070 [2019-12-07 11:11:10,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85818 states. [2019-12-07 11:11:11,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85818 to 66192. [2019-12-07 11:11:11,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66192 states. [2019-12-07 11:11:11,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66192 states to 66192 states and 194965 transitions. [2019-12-07 11:11:11,332 INFO L78 Accepts]: Start accepts. Automaton has 66192 states and 194965 transitions. Word has length 72 [2019-12-07 11:11:11,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:11:11,332 INFO L462 AbstractCegarLoop]: Abstraction has 66192 states and 194965 transitions. [2019-12-07 11:11:11,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-07 11:11:11,332 INFO L276 IsEmpty]: Start isEmpty. Operand 66192 states and 194965 transitions. [2019-12-07 11:11:11,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:11:11,403 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:11:11,403 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:11:11,403 INFO L410 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:11:11,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:11:11,403 INFO L82 PathProgramCache]: Analyzing trace with hash -51250329, now seen corresponding path program 84 times [2019-12-07 11:11:11,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:11:11,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999217647] [2019-12-07 11:11:11,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:11:11,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:11:11,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:11:11,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999217647] [2019-12-07 11:11:11,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:11:11,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-07 11:11:11,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411756487] [2019-12-07 11:11:11,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-07 11:11:11,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:11:11,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-07 11:11:11,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2019-12-07 11:11:11,836 INFO L87 Difference]: Start difference. First operand 66192 states and 194965 transitions. Second operand 23 states. [2019-12-07 11:11:13,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:11:13,957 INFO L93 Difference]: Finished difference Result 86769 states and 250629 transitions. [2019-12-07 11:11:13,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-07 11:11:13,957 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 72 [2019-12-07 11:11:13,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:11:14,061 INFO L225 Difference]: With dead ends: 86769 [2019-12-07 11:11:14,061 INFO L226 Difference]: Without dead ends: 83774 [2019-12-07 11:11:14,061 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=226, Invalid=1936, Unknown=0, NotChecked=0, Total=2162 [2019-12-07 11:11:14,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83774 states. [2019-12-07 11:11:14,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83774 to 63926. [2019-12-07 11:11:14,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63926 states. [2019-12-07 11:11:15,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63926 states to 63926 states and 187798 transitions. [2019-12-07 11:11:15,094 INFO L78 Accepts]: Start accepts. Automaton has 63926 states and 187798 transitions. Word has length 72 [2019-12-07 11:11:15,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:11:15,094 INFO L462 AbstractCegarLoop]: Abstraction has 63926 states and 187798 transitions. [2019-12-07 11:11:15,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-07 11:11:15,094 INFO L276 IsEmpty]: Start isEmpty. Operand 63926 states and 187798 transitions. [2019-12-07 11:11:15,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:11:15,161 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:11:15,161 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:11:15,161 INFO L410 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:11:15,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:11:15,162 INFO L82 PathProgramCache]: Analyzing trace with hash 469742263, now seen corresponding path program 85 times [2019-12-07 11:11:15,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:11:15,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274911507] [2019-12-07 11:11:15,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:11:15,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:11:15,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:11:15,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274911507] [2019-12-07 11:11:15,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:11:15,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-12-07 11:11:15,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060681402] [2019-12-07 11:11:15,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-07 11:11:15,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:11:15,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-07 11:11:15,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=495, Unknown=0, NotChecked=0, Total=552 [2019-12-07 11:11:15,595 INFO L87 Difference]: Start difference. First operand 63926 states and 187798 transitions. Second operand 24 states. [2019-12-07 11:11:17,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:11:17,750 INFO L93 Difference]: Finished difference Result 82270 states and 236856 transitions. [2019-12-07 11:11:17,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-07 11:11:17,750 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 72 [2019-12-07 11:11:17,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:11:17,851 INFO L225 Difference]: With dead ends: 82270 [2019-12-07 11:11:17,851 INFO L226 Difference]: Without dead ends: 81957 [2019-12-07 11:11:17,852 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=237, Invalid=2115, Unknown=0, NotChecked=0, Total=2352 [2019-12-07 11:11:18,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81957 states. [2019-12-07 11:11:18,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81957 to 62873. [2019-12-07 11:11:18,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62873 states. [2019-12-07 11:11:18,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62873 states to 62873 states and 184471 transitions. [2019-12-07 11:11:18,910 INFO L78 Accepts]: Start accepts. Automaton has 62873 states and 184471 transitions. Word has length 72 [2019-12-07 11:11:18,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:11:18,910 INFO L462 AbstractCegarLoop]: Abstraction has 62873 states and 184471 transitions. [2019-12-07 11:11:18,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-07 11:11:18,910 INFO L276 IsEmpty]: Start isEmpty. Operand 62873 states and 184471 transitions. [2019-12-07 11:11:18,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:11:18,977 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:11:18,977 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:11:18,977 INFO L410 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:11:18,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:11:18,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1087960221, now seen corresponding path program 86 times [2019-12-07 11:11:18,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:11:18,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103072331] [2019-12-07 11:11:18,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:11:18,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:11:19,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:11:19,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103072331] [2019-12-07 11:11:19,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:11:19,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-07 11:11:19,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073938724] [2019-12-07 11:11:19,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-07 11:11:19,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:11:19,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-07 11:11:19,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=451, Unknown=0, NotChecked=0, Total=506 [2019-12-07 11:11:19,388 INFO L87 Difference]: Start difference. First operand 62873 states and 184471 transitions. Second operand 23 states. [2019-12-07 11:11:21,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:11:21,424 INFO L93 Difference]: Finished difference Result 81386 states and 234135 transitions. [2019-12-07 11:11:21,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-07 11:11:21,424 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 72 [2019-12-07 11:11:21,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:11:21,524 INFO L225 Difference]: With dead ends: 81386 [2019-12-07 11:11:21,524 INFO L226 Difference]: Without dead ends: 81203 [2019-12-07 11:11:21,524 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=236, Invalid=2020, Unknown=0, NotChecked=0, Total=2256 [2019-12-07 11:11:21,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81203 states. [2019-12-07 11:11:22,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81203 to 62811. [2019-12-07 11:11:22,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62811 states. [2019-12-07 11:11:22,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62811 states to 62811 states and 184230 transitions. [2019-12-07 11:11:22,529 INFO L78 Accepts]: Start accepts. Automaton has 62811 states and 184230 transitions. Word has length 72 [2019-12-07 11:11:22,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:11:22,529 INFO L462 AbstractCegarLoop]: Abstraction has 62811 states and 184230 transitions. [2019-12-07 11:11:22,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-07 11:11:22,529 INFO L276 IsEmpty]: Start isEmpty. Operand 62811 states and 184230 transitions. [2019-12-07 11:11:22,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:11:22,594 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:11:22,594 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:11:22,594 INFO L410 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:11:22,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:11:22,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1468449479, now seen corresponding path program 87 times [2019-12-07 11:11:22,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:11:22,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270967891] [2019-12-07 11:11:22,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:11:22,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:11:23,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:11:23,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270967891] [2019-12-07 11:11:23,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:11:23,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-12-07 11:11:23,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922805419] [2019-12-07 11:11:23,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-07 11:11:23,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:11:23,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-07 11:11:23,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=492, Unknown=0, NotChecked=0, Total=552 [2019-12-07 11:11:23,050 INFO L87 Difference]: Start difference. First operand 62811 states and 184230 transitions. Second operand 24 states. [2019-12-07 11:11:28,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:11:28,762 INFO L93 Difference]: Finished difference Result 91510 states and 267700 transitions. [2019-12-07 11:11:28,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-12-07 11:11:28,763 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 72 [2019-12-07 11:11:28,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:11:28,866 INFO L225 Difference]: With dead ends: 91510 [2019-12-07 11:11:28,867 INFO L226 Difference]: Without dead ends: 74643 [2019-12-07 11:11:28,867 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1037 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=410, Invalid=3622, Unknown=0, NotChecked=0, Total=4032 [2019-12-07 11:11:29,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74643 states. [2019-12-07 11:11:29,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74643 to 59780. [2019-12-07 11:11:29,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59780 states. [2019-12-07 11:11:29,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59780 states to 59780 states and 174947 transitions. [2019-12-07 11:11:29,984 INFO L78 Accepts]: Start accepts. Automaton has 59780 states and 174947 transitions. Word has length 72 [2019-12-07 11:11:29,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:11:29,984 INFO L462 AbstractCegarLoop]: Abstraction has 59780 states and 174947 transitions. [2019-12-07 11:11:29,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-07 11:11:29,984 INFO L276 IsEmpty]: Start isEmpty. Operand 59780 states and 174947 transitions. [2019-12-07 11:11:30,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:11:30,042 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:11:30,042 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:11:30,042 INFO L410 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:11:30,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:11:30,043 INFO L82 PathProgramCache]: Analyzing trace with hash -339609475, now seen corresponding path program 88 times [2019-12-07 11:11:30,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:11:30,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742031977] [2019-12-07 11:11:30,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:11:30,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:11:30,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:11:30,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742031977] [2019-12-07 11:11:30,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:11:30,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-07 11:11:30,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521395336] [2019-12-07 11:11:30,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-07 11:11:30,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:11:30,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-07 11:11:30,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2019-12-07 11:11:30,490 INFO L87 Difference]: Start difference. First operand 59780 states and 174947 transitions. Second operand 21 states. [2019-12-07 11:11:32,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:11:32,898 INFO L93 Difference]: Finished difference Result 80093 states and 233641 transitions. [2019-12-07 11:11:32,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-07 11:11:32,899 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 72 [2019-12-07 11:11:32,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:11:32,998 INFO L225 Difference]: With dead ends: 80093 [2019-12-07 11:11:32,998 INFO L226 Difference]: Without dead ends: 75957 [2019-12-07 11:11:32,998 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=221, Invalid=1759, Unknown=0, NotChecked=0, Total=1980 [2019-12-07 11:11:33,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75957 states. [2019-12-07 11:11:33,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75957 to 58992. [2019-12-07 11:11:33,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58992 states. [2019-12-07 11:11:33,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58992 states to 58992 states and 172443 transitions. [2019-12-07 11:11:33,924 INFO L78 Accepts]: Start accepts. Automaton has 58992 states and 172443 transitions. Word has length 72 [2019-12-07 11:11:33,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:11:33,924 INFO L462 AbstractCegarLoop]: Abstraction has 58992 states and 172443 transitions. [2019-12-07 11:11:33,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-07 11:11:33,924 INFO L276 IsEmpty]: Start isEmpty. Operand 58992 states and 172443 transitions. [2019-12-07 11:11:33,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:11:33,986 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:11:33,986 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:11:33,986 INFO L410 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:11:33,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:11:33,986 INFO L82 PathProgramCache]: Analyzing trace with hash 129344239, now seen corresponding path program 89 times [2019-12-07 11:11:33,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:11:33,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248448692] [2019-12-07 11:11:33,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:11:34,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:11:34,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:11:34,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248448692] [2019-12-07 11:11:34,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:11:34,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-07 11:11:34,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723281572] [2019-12-07 11:11:34,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 11:11:34,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:11:34,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 11:11:34,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-12-07 11:11:34,362 INFO L87 Difference]: Start difference. First operand 58992 states and 172443 transitions. Second operand 19 states. [2019-12-07 11:11:39,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:11:39,623 INFO L93 Difference]: Finished difference Result 68670 states and 196151 transitions. [2019-12-07 11:11:39,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-12-07 11:11:39,624 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 72 [2019-12-07 11:11:39,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:11:39,717 INFO L225 Difference]: With dead ends: 68670 [2019-12-07 11:11:39,717 INFO L226 Difference]: Without dead ends: 68091 [2019-12-07 11:11:39,717 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 802 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=447, Invalid=2975, Unknown=0, NotChecked=0, Total=3422 [2019-12-07 11:11:39,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68091 states. [2019-12-07 11:11:40,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68091 to 59276. [2019-12-07 11:11:40,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59276 states. [2019-12-07 11:11:40,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59276 states to 59276 states and 173080 transitions. [2019-12-07 11:11:40,590 INFO L78 Accepts]: Start accepts. Automaton has 59276 states and 173080 transitions. Word has length 72 [2019-12-07 11:11:40,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:11:40,590 INFO L462 AbstractCegarLoop]: Abstraction has 59276 states and 173080 transitions. [2019-12-07 11:11:40,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 11:11:40,590 INFO L276 IsEmpty]: Start isEmpty. Operand 59276 states and 173080 transitions. [2019-12-07 11:11:40,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:11:40,648 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:11:40,648 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:11:40,648 INFO L410 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:11:40,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:11:40,649 INFO L82 PathProgramCache]: Analyzing trace with hash -984384883, now seen corresponding path program 90 times [2019-12-07 11:11:40,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:11:40,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537760941] [2019-12-07 11:11:40,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:11:40,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:11:41,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:11:41,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537760941] [2019-12-07 11:11:41,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:11:41,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-07 11:11:41,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149157757] [2019-12-07 11:11:41,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 11:11:41,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:11:41,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 11:11:41,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2019-12-07 11:11:41,011 INFO L87 Difference]: Start difference. First operand 59276 states and 173080 transitions. Second operand 19 states. [2019-12-07 11:11:43,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:11:43,256 INFO L93 Difference]: Finished difference Result 63188 states and 182332 transitions. [2019-12-07 11:11:43,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-07 11:11:43,257 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 72 [2019-12-07 11:11:43,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:11:43,336 INFO L225 Difference]: With dead ends: 63188 [2019-12-07 11:11:43,336 INFO L226 Difference]: Without dead ends: 62676 [2019-12-07 11:11:43,336 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=233, Invalid=1489, Unknown=0, NotChecked=0, Total=1722 [2019-12-07 11:11:43,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62676 states. [2019-12-07 11:11:44,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62676 to 59287. [2019-12-07 11:11:44,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59287 states. [2019-12-07 11:11:44,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59287 states to 59287 states and 173093 transitions. [2019-12-07 11:11:44,167 INFO L78 Accepts]: Start accepts. Automaton has 59287 states and 173093 transitions. Word has length 72 [2019-12-07 11:11:44,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:11:44,168 INFO L462 AbstractCegarLoop]: Abstraction has 59287 states and 173093 transitions. [2019-12-07 11:11:44,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 11:11:44,168 INFO L276 IsEmpty]: Start isEmpty. Operand 59287 states and 173093 transitions. [2019-12-07 11:11:44,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:11:44,230 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:11:44,230 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:11:44,230 INFO L410 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:11:44,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:11:44,230 INFO L82 PathProgramCache]: Analyzing trace with hash -627067369, now seen corresponding path program 91 times [2019-12-07 11:11:44,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:11:44,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620680163] [2019-12-07 11:11:44,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:11:44,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:11:44,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:11:44,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620680163] [2019-12-07 11:11:44,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:11:44,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-12-07 11:11:44,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831323185] [2019-12-07 11:11:44,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-07 11:11:44,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:11:44,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-07 11:11:44,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2019-12-07 11:11:44,577 INFO L87 Difference]: Start difference. First operand 59287 states and 173093 transitions. Second operand 22 states. [2019-12-07 11:11:46,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:11:46,647 INFO L93 Difference]: Finished difference Result 78187 states and 227725 transitions. [2019-12-07 11:11:46,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-07 11:11:46,647 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 72 [2019-12-07 11:11:46,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:11:46,741 INFO L225 Difference]: With dead ends: 78187 [2019-12-07 11:11:46,741 INFO L226 Difference]: Without dead ends: 75027 [2019-12-07 11:11:46,741 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=262, Invalid=1900, Unknown=0, NotChecked=0, Total=2162 [2019-12-07 11:11:46,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75027 states. [2019-12-07 11:11:47,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75027 to 58727. [2019-12-07 11:11:47,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58727 states. [2019-12-07 11:11:47,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58727 states to 58727 states and 172098 transitions. [2019-12-07 11:11:47,656 INFO L78 Accepts]: Start accepts. Automaton has 58727 states and 172098 transitions. Word has length 72 [2019-12-07 11:11:47,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:11:47,656 INFO L462 AbstractCegarLoop]: Abstraction has 58727 states and 172098 transitions. [2019-12-07 11:11:47,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-07 11:11:47,656 INFO L276 IsEmpty]: Start isEmpty. Operand 58727 states and 172098 transitions. [2019-12-07 11:11:47,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:11:47,718 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:11:47,718 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:11:47,719 INFO L410 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:11:47,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:11:47,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1858865819, now seen corresponding path program 92 times [2019-12-07 11:11:47,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:11:47,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024120227] [2019-12-07 11:11:47,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:11:47,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:11:48,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:11:48,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024120227] [2019-12-07 11:11:48,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:11:48,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-12-07 11:11:48,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379460075] [2019-12-07 11:11:48,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-07 11:11:48,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:11:48,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-07 11:11:48,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=633, Unknown=0, NotChecked=0, Total=702 [2019-12-07 11:11:48,511 INFO L87 Difference]: Start difference. First operand 58727 states and 172098 transitions. Second operand 27 states. [2019-12-07 11:11:52,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:11:52,755 INFO L93 Difference]: Finished difference Result 69192 states and 201265 transitions. [2019-12-07 11:11:52,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-07 11:11:52,756 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 72 [2019-12-07 11:11:52,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:11:52,850 INFO L225 Difference]: With dead ends: 69192 [2019-12-07 11:11:52,850 INFO L226 Difference]: Without dead ends: 66349 [2019-12-07 11:11:52,850 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=350, Invalid=2956, Unknown=0, NotChecked=0, Total=3306 [2019-12-07 11:11:53,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66349 states. [2019-12-07 11:11:53,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66349 to 60197. [2019-12-07 11:11:53,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60197 states. [2019-12-07 11:11:53,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60197 states to 60197 states and 176247 transitions. [2019-12-07 11:11:53,761 INFO L78 Accepts]: Start accepts. Automaton has 60197 states and 176247 transitions. Word has length 72 [2019-12-07 11:11:53,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:11:53,761 INFO L462 AbstractCegarLoop]: Abstraction has 60197 states and 176247 transitions. [2019-12-07 11:11:53,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-07 11:11:53,761 INFO L276 IsEmpty]: Start isEmpty. Operand 60197 states and 176247 transitions. [2019-12-07 11:11:53,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:11:53,827 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:11:53,827 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:11:53,827 INFO L410 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:11:53,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:11:53,828 INFO L82 PathProgramCache]: Analyzing trace with hash 713384715, now seen corresponding path program 93 times [2019-12-07 11:11:53,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:11:53,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152261952] [2019-12-07 11:11:53,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:11:53,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:11:54,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:11:54,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152261952] [2019-12-07 11:11:54,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:11:54,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-07 11:11:54,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975639828] [2019-12-07 11:11:54,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-07 11:11:54,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:11:54,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-07 11:11:54,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2019-12-07 11:11:54,190 INFO L87 Difference]: Start difference. First operand 60197 states and 176247 transitions. Second operand 20 states. [2019-12-07 11:11:56,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:11:56,968 INFO L93 Difference]: Finished difference Result 63567 states and 184280 transitions. [2019-12-07 11:11:56,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-07 11:11:56,968 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 72 [2019-12-07 11:11:56,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:11:57,047 INFO L225 Difference]: With dead ends: 63567 [2019-12-07 11:11:57,047 INFO L226 Difference]: Without dead ends: 63505 [2019-12-07 11:11:57,047 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=224, Invalid=1416, Unknown=0, NotChecked=0, Total=1640 [2019-12-07 11:11:57,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63505 states. [2019-12-07 11:11:57,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63505 to 60153. [2019-12-07 11:11:57,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60153 states. [2019-12-07 11:11:57,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60153 states to 60153 states and 176175 transitions. [2019-12-07 11:11:57,899 INFO L78 Accepts]: Start accepts. Automaton has 60153 states and 176175 transitions. Word has length 72 [2019-12-07 11:11:57,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:11:57,899 INFO L462 AbstractCegarLoop]: Abstraction has 60153 states and 176175 transitions. [2019-12-07 11:11:57,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-07 11:11:57,900 INFO L276 IsEmpty]: Start isEmpty. Operand 60153 states and 176175 transitions. [2019-12-07 11:11:57,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:11:57,963 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:11:57,963 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:11:57,963 INFO L410 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:11:57,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:11:57,964 INFO L82 PathProgramCache]: Analyzing trace with hash 127577677, now seen corresponding path program 94 times [2019-12-07 11:11:57,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:11:57,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793483334] [2019-12-07 11:11:57,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:11:57,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:11:58,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:11:58,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793483334] [2019-12-07 11:11:58,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:11:58,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 11:11:58,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611956463] [2019-12-07 11:11:58,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 11:11:58,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:11:58,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 11:11:58,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-12-07 11:11:58,166 INFO L87 Difference]: Start difference. First operand 60153 states and 176175 transitions. Second operand 14 states. [2019-12-07 11:11:59,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:11:59,292 INFO L93 Difference]: Finished difference Result 65302 states and 189573 transitions. [2019-12-07 11:11:59,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 11:11:59,292 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 72 [2019-12-07 11:11:59,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:11:59,371 INFO L225 Difference]: With dead ends: 65302 [2019-12-07 11:11:59,371 INFO L226 Difference]: Without dead ends: 63965 [2019-12-07 11:11:59,371 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2019-12-07 11:11:59,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63965 states. [2019-12-07 11:12:00,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63965 to 60195. [2019-12-07 11:12:00,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60195 states. [2019-12-07 11:12:00,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60195 states to 60195 states and 176203 transitions. [2019-12-07 11:12:00,232 INFO L78 Accepts]: Start accepts. Automaton has 60195 states and 176203 transitions. Word has length 72 [2019-12-07 11:12:00,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:12:00,232 INFO L462 AbstractCegarLoop]: Abstraction has 60195 states and 176203 transitions. [2019-12-07 11:12:00,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 11:12:00,233 INFO L276 IsEmpty]: Start isEmpty. Operand 60195 states and 176203 transitions. [2019-12-07 11:12:00,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:12:00,296 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:12:00,296 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:12:00,296 INFO L410 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:12:00,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:12:00,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1429788601, now seen corresponding path program 95 times [2019-12-07 11:12:00,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:12:00,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995866036] [2019-12-07 11:12:00,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:12:00,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:12:00,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:12:00,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995866036] [2019-12-07 11:12:00,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:12:00,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-07 11:12:00,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337112204] [2019-12-07 11:12:00,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 11:12:00,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:12:00,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 11:12:00,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-12-07 11:12:00,623 INFO L87 Difference]: Start difference. First operand 60195 states and 176203 transitions. Second operand 17 states. [2019-12-07 11:12:02,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:12:02,554 INFO L93 Difference]: Finished difference Result 70919 states and 205940 transitions. [2019-12-07 11:12:02,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 11:12:02,554 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 72 [2019-12-07 11:12:02,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:12:02,734 INFO L225 Difference]: With dead ends: 70919 [2019-12-07 11:12:02,735 INFO L226 Difference]: Without dead ends: 67232 [2019-12-07 11:12:02,735 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=747, Unknown=0, NotChecked=0, Total=870 [2019-12-07 11:12:02,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67232 states. [2019-12-07 11:12:03,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67232 to 60242. [2019-12-07 11:12:03,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60242 states. [2019-12-07 11:12:03,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60242 states to 60242 states and 176130 transitions. [2019-12-07 11:12:03,560 INFO L78 Accepts]: Start accepts. Automaton has 60242 states and 176130 transitions. Word has length 72 [2019-12-07 11:12:03,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:12:03,560 INFO L462 AbstractCegarLoop]: Abstraction has 60242 states and 176130 transitions. [2019-12-07 11:12:03,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 11:12:03,560 INFO L276 IsEmpty]: Start isEmpty. Operand 60242 states and 176130 transitions. [2019-12-07 11:12:03,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:12:03,623 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:12:03,624 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:12:03,624 INFO L410 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:12:03,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:12:03,624 INFO L82 PathProgramCache]: Analyzing trace with hash 2107317997, now seen corresponding path program 96 times [2019-12-07 11:12:03,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:12:03,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965540779] [2019-12-07 11:12:03,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:12:03,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:12:04,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:12:04,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965540779] [2019-12-07 11:12:04,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:12:04,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-07 11:12:04,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820585233] [2019-12-07 11:12:04,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 11:12:04,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:12:04,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 11:12:04,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-12-07 11:12:04,089 INFO L87 Difference]: Start difference. First operand 60242 states and 176130 transitions. Second operand 18 states. [2019-12-07 11:12:05,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:12:05,867 INFO L93 Difference]: Finished difference Result 72017 states and 208383 transitions. [2019-12-07 11:12:05,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-07 11:12:05,867 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 72 [2019-12-07 11:12:05,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:12:05,949 INFO L225 Difference]: With dead ends: 72017 [2019-12-07 11:12:05,949 INFO L226 Difference]: Without dead ends: 66632 [2019-12-07 11:12:05,949 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=152, Invalid=1038, Unknown=0, NotChecked=0, Total=1190 [2019-12-07 11:12:06,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66632 states. [2019-12-07 11:12:06,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66632 to 59146. [2019-12-07 11:12:06,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59146 states. [2019-12-07 11:12:06,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59146 states to 59146 states and 173069 transitions. [2019-12-07 11:12:06,802 INFO L78 Accepts]: Start accepts. Automaton has 59146 states and 173069 transitions. Word has length 72 [2019-12-07 11:12:06,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:12:06,802 INFO L462 AbstractCegarLoop]: Abstraction has 59146 states and 173069 transitions. [2019-12-07 11:12:06,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 11:12:06,802 INFO L276 IsEmpty]: Start isEmpty. Operand 59146 states and 173069 transitions. [2019-12-07 11:12:06,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:12:06,865 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:12:06,865 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:12:06,865 INFO L410 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:12:06,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:12:06,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1954644727, now seen corresponding path program 97 times [2019-12-07 11:12:06,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:12:06,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975427673] [2019-12-07 11:12:06,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:12:06,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:12:07,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:12:07,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975427673] [2019-12-07 11:12:07,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:12:07,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-07 11:12:07,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078317239] [2019-12-07 11:12:07,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-07 11:12:07,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:12:07,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-07 11:12:07,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2019-12-07 11:12:07,239 INFO L87 Difference]: Start difference. First operand 59146 states and 173069 transitions. Second operand 21 states. [2019-12-07 11:12:09,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:12:09,185 INFO L93 Difference]: Finished difference Result 65390 states and 188919 transitions. [2019-12-07 11:12:09,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-07 11:12:09,185 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 72 [2019-12-07 11:12:09,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:12:09,264 INFO L225 Difference]: With dead ends: 65390 [2019-12-07 11:12:09,264 INFO L226 Difference]: Without dead ends: 64618 [2019-12-07 11:12:09,265 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=196, Invalid=1444, Unknown=0, NotChecked=0, Total=1640 [2019-12-07 11:12:09,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64618 states. [2019-12-07 11:12:10,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64618 to 58810. [2019-12-07 11:12:10,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58810 states. [2019-12-07 11:12:10,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58810 states to 58810 states and 172314 transitions. [2019-12-07 11:12:10,111 INFO L78 Accepts]: Start accepts. Automaton has 58810 states and 172314 transitions. Word has length 72 [2019-12-07 11:12:10,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:12:10,112 INFO L462 AbstractCegarLoop]: Abstraction has 58810 states and 172314 transitions. [2019-12-07 11:12:10,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-07 11:12:10,112 INFO L276 IsEmpty]: Start isEmpty. Operand 58810 states and 172314 transitions. [2019-12-07 11:12:10,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:12:10,174 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:12:10,174 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:12:10,174 INFO L410 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:12:10,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:12:10,175 INFO L82 PathProgramCache]: Analyzing trace with hash 995321631, now seen corresponding path program 98 times [2019-12-07 11:12:10,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:12:10,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490535972] [2019-12-07 11:12:10,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:12:10,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:12:10,514 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 20 [2019-12-07 11:12:10,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:12:10,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490535972] [2019-12-07 11:12:10,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:12:10,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-07 11:12:10,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005243247] [2019-12-07 11:12:10,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-07 11:12:10,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:12:10,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-07 11:12:10,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2019-12-07 11:12:10,828 INFO L87 Difference]: Start difference. First operand 58810 states and 172314 transitions. Second operand 20 states. [2019-12-07 11:12:12,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:12:12,681 INFO L93 Difference]: Finished difference Result 64268 states and 186784 transitions. [2019-12-07 11:12:12,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-07 11:12:12,682 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 72 [2019-12-07 11:12:12,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:12:12,760 INFO L225 Difference]: With dead ends: 64268 [2019-12-07 11:12:12,760 INFO L226 Difference]: Without dead ends: 63069 [2019-12-07 11:12:12,760 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 6 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=160, Invalid=1100, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 11:12:12,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63069 states. [2019-12-07 11:12:13,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63069 to 58756. [2019-12-07 11:12:13,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58756 states. [2019-12-07 11:12:13,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58756 states to 58756 states and 172079 transitions. [2019-12-07 11:12:13,597 INFO L78 Accepts]: Start accepts. Automaton has 58756 states and 172079 transitions. Word has length 72 [2019-12-07 11:12:13,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:12:13,598 INFO L462 AbstractCegarLoop]: Abstraction has 58756 states and 172079 transitions. [2019-12-07 11:12:13,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-07 11:12:13,598 INFO L276 IsEmpty]: Start isEmpty. Operand 58756 states and 172079 transitions. [2019-12-07 11:12:13,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:12:13,662 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:12:13,662 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:12:13,662 INFO L410 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:12:13,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:12:13,662 INFO L82 PathProgramCache]: Analyzing trace with hash 237460933, now seen corresponding path program 99 times [2019-12-07 11:12:13,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:12:13,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698851021] [2019-12-07 11:12:13,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:12:13,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:12:14,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:12:14,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698851021] [2019-12-07 11:12:14,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:12:14,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-07 11:12:14,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816695388] [2019-12-07 11:12:14,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 11:12:14,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:12:14,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 11:12:14,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2019-12-07 11:12:14,029 INFO L87 Difference]: Start difference. First operand 58756 states and 172079 transitions. Second operand 19 states. [2019-12-07 11:12:16,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:12:16,142 INFO L93 Difference]: Finished difference Result 64321 states and 186736 transitions. [2019-12-07 11:12:16,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-07 11:12:16,142 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 72 [2019-12-07 11:12:16,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:12:16,222 INFO L225 Difference]: With dead ends: 64321 [2019-12-07 11:12:16,222 INFO L226 Difference]: Without dead ends: 62678 [2019-12-07 11:12:16,222 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=219, Invalid=1587, Unknown=0, NotChecked=0, Total=1806 [2019-12-07 11:12:16,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62678 states. [2019-12-07 11:12:16,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62678 to 58888. [2019-12-07 11:12:16,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58888 states. [2019-12-07 11:12:17,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58888 states to 58888 states and 172394 transitions. [2019-12-07 11:12:17,055 INFO L78 Accepts]: Start accepts. Automaton has 58888 states and 172394 transitions. Word has length 72 [2019-12-07 11:12:17,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:12:17,055 INFO L462 AbstractCegarLoop]: Abstraction has 58888 states and 172394 transitions. [2019-12-07 11:12:17,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 11:12:17,055 INFO L276 IsEmpty]: Start isEmpty. Operand 58888 states and 172394 transitions. [2019-12-07 11:12:17,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:12:17,119 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:12:17,119 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:12:17,119 INFO L410 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:12:17,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:12:17,120 INFO L82 PathProgramCache]: Analyzing trace with hash 470465505, now seen corresponding path program 100 times [2019-12-07 11:12:17,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:12:17,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863986550] [2019-12-07 11:12:17,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:12:17,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:12:17,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:12:17,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863986550] [2019-12-07 11:12:17,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:12:17,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-07 11:12:17,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388942278] [2019-12-07 11:12:17,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-07 11:12:17,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:12:17,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-07 11:12:17,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2019-12-07 11:12:17,496 INFO L87 Difference]: Start difference. First operand 58888 states and 172394 transitions. Second operand 20 states. [2019-12-07 11:12:19,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:12:19,186 INFO L93 Difference]: Finished difference Result 63859 states and 184324 transitions. [2019-12-07 11:12:19,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-07 11:12:19,186 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 72 [2019-12-07 11:12:19,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:12:19,263 INFO L225 Difference]: With dead ends: 63859 [2019-12-07 11:12:19,264 INFO L226 Difference]: Without dead ends: 62702 [2019-12-07 11:12:19,264 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=184, Invalid=1376, Unknown=0, NotChecked=0, Total=1560 [2019-12-07 11:12:19,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62702 states. [2019-12-07 11:12:20,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62702 to 58444. [2019-12-07 11:12:20,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58444 states. [2019-12-07 11:12:20,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58444 states to 58444 states and 171403 transitions. [2019-12-07 11:12:20,136 INFO L78 Accepts]: Start accepts. Automaton has 58444 states and 171403 transitions. Word has length 72 [2019-12-07 11:12:20,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:12:20,136 INFO L462 AbstractCegarLoop]: Abstraction has 58444 states and 171403 transitions. [2019-12-07 11:12:20,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-07 11:12:20,137 INFO L276 IsEmpty]: Start isEmpty. Operand 58444 states and 171403 transitions. [2019-12-07 11:12:20,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:12:20,199 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:12:20,199 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:12:20,199 INFO L410 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:12:20,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:12:20,200 INFO L82 PathProgramCache]: Analyzing trace with hash -2096844177, now seen corresponding path program 101 times [2019-12-07 11:12:20,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:12:20,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418296220] [2019-12-07 11:12:20,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:12:20,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:12:20,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:12:20,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418296220] [2019-12-07 11:12:20,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:12:20,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-07 11:12:20,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591459755] [2019-12-07 11:12:20,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 11:12:20,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:12:20,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 11:12:20,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-12-07 11:12:20,515 INFO L87 Difference]: Start difference. First operand 58444 states and 171403 transitions. Second operand 17 states. [2019-12-07 11:12:23,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:12:23,579 INFO L93 Difference]: Finished difference Result 63417 states and 185468 transitions. [2019-12-07 11:12:23,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 11:12:23,580 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 72 [2019-12-07 11:12:23,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:12:23,667 INFO L225 Difference]: With dead ends: 63417 [2019-12-07 11:12:23,667 INFO L226 Difference]: Without dead ends: 60866 [2019-12-07 11:12:23,667 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=127, Invalid=865, Unknown=0, NotChecked=0, Total=992 [2019-12-07 11:12:23,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60866 states. [2019-12-07 11:12:24,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60866 to 58605. [2019-12-07 11:12:24,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58605 states. [2019-12-07 11:12:24,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58605 states to 58605 states and 171819 transitions. [2019-12-07 11:12:24,499 INFO L78 Accepts]: Start accepts. Automaton has 58605 states and 171819 transitions. Word has length 72 [2019-12-07 11:12:24,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:12:24,500 INFO L462 AbstractCegarLoop]: Abstraction has 58605 states and 171819 transitions. [2019-12-07 11:12:24,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 11:12:24,500 INFO L276 IsEmpty]: Start isEmpty. Operand 58605 states and 171819 transitions. [2019-12-07 11:12:24,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:12:24,562 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:12:24,562 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:12:24,563 INFO L410 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:12:24,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:12:24,563 INFO L82 PathProgramCache]: Analyzing trace with hash 390064165, now seen corresponding path program 102 times [2019-12-07 11:12:24,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:12:24,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244351994] [2019-12-07 11:12:24,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:12:24,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:12:24,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:12:24,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244351994] [2019-12-07 11:12:24,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:12:24,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 11:12:24,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401626898] [2019-12-07 11:12:24,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 11:12:24,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:12:24,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 11:12:24,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-12-07 11:12:24,756 INFO L87 Difference]: Start difference. First operand 58605 states and 171819 transitions. Second operand 14 states. [2019-12-07 11:12:26,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:12:26,790 INFO L93 Difference]: Finished difference Result 63578 states and 186586 transitions. [2019-12-07 11:12:26,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 11:12:26,790 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 72 [2019-12-07 11:12:26,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:12:26,870 INFO L225 Difference]: With dead ends: 63578 [2019-12-07 11:12:26,870 INFO L226 Difference]: Without dead ends: 61382 [2019-12-07 11:12:26,870 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2019-12-07 11:12:27,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61382 states. [2019-12-07 11:12:27,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61382 to 58624. [2019-12-07 11:12:27,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58624 states. [2019-12-07 11:12:27,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58624 states to 58624 states and 171842 transitions. [2019-12-07 11:12:27,695 INFO L78 Accepts]: Start accepts. Automaton has 58624 states and 171842 transitions. Word has length 72 [2019-12-07 11:12:27,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:12:27,695 INFO L462 AbstractCegarLoop]: Abstraction has 58624 states and 171842 transitions. [2019-12-07 11:12:27,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 11:12:27,695 INFO L276 IsEmpty]: Start isEmpty. Operand 58624 states and 171842 transitions. [2019-12-07 11:12:27,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:12:27,757 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:12:27,757 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:12:27,757 INFO L410 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:12:27,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:12:27,757 INFO L82 PathProgramCache]: Analyzing trace with hash 859017879, now seen corresponding path program 103 times [2019-12-07 11:12:27,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:12:27,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087692817] [2019-12-07 11:12:27,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:12:27,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:12:28,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:12:28,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087692817] [2019-12-07 11:12:28,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:12:28,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-07 11:12:28,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067044766] [2019-12-07 11:12:28,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-07 11:12:28,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:12:28,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-07 11:12:28,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2019-12-07 11:12:28,289 INFO L87 Difference]: Start difference. First operand 58624 states and 171842 transitions. Second operand 20 states. [2019-12-07 11:12:31,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:12:31,094 INFO L93 Difference]: Finished difference Result 64673 states and 189345 transitions. [2019-12-07 11:12:31,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-07 11:12:31,094 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 72 [2019-12-07 11:12:31,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:12:31,267 INFO L225 Difference]: With dead ends: 64673 [2019-12-07 11:12:31,267 INFO L226 Difference]: Without dead ends: 62025 [2019-12-07 11:12:31,268 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=229, Invalid=1493, Unknown=0, NotChecked=0, Total=1722 [2019-12-07 11:12:31,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62025 states. [2019-12-07 11:12:31,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62025 to 59163. [2019-12-07 11:12:31,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59163 states. [2019-12-07 11:12:32,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59163 states to 59163 states and 173339 transitions. [2019-12-07 11:12:32,040 INFO L78 Accepts]: Start accepts. Automaton has 59163 states and 173339 transitions. Word has length 72 [2019-12-07 11:12:32,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:12:32,041 INFO L462 AbstractCegarLoop]: Abstraction has 59163 states and 173339 transitions. [2019-12-07 11:12:32,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-07 11:12:32,041 INFO L276 IsEmpty]: Start isEmpty. Operand 59163 states and 173339 transitions. [2019-12-07 11:12:32,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:12:32,103 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:12:32,103 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:12:32,104 INFO L410 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:12:32,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:12:32,104 INFO L82 PathProgramCache]: Analyzing trace with hash 274393159, now seen corresponding path program 104 times [2019-12-07 11:12:32,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:12:32,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731565020] [2019-12-07 11:12:32,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:12:32,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:12:32,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:12:32,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731565020] [2019-12-07 11:12:32,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:12:32,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-07 11:12:32,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938966523] [2019-12-07 11:12:32,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-07 11:12:32,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:12:32,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-07 11:12:32,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2019-12-07 11:12:32,770 INFO L87 Difference]: Start difference. First operand 59163 states and 173339 transitions. Second operand 20 states. [2019-12-07 11:12:35,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:12:35,649 INFO L93 Difference]: Finished difference Result 64223 states and 187457 transitions. [2019-12-07 11:12:35,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-07 11:12:35,649 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 72 [2019-12-07 11:12:35,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:12:35,727 INFO L225 Difference]: With dead ends: 64223 [2019-12-07 11:12:35,727 INFO L226 Difference]: Without dead ends: 62105 [2019-12-07 11:12:35,727 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=270, Invalid=2082, Unknown=0, NotChecked=0, Total=2352 [2019-12-07 11:12:35,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62105 states. [2019-12-07 11:12:36,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62105 to 59550. [2019-12-07 11:12:36,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59550 states. [2019-12-07 11:12:36,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59550 states to 59550 states and 174345 transitions. [2019-12-07 11:12:36,584 INFO L78 Accepts]: Start accepts. Automaton has 59550 states and 174345 transitions. Word has length 72 [2019-12-07 11:12:36,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:12:36,584 INFO L462 AbstractCegarLoop]: Abstraction has 59550 states and 174345 transitions. [2019-12-07 11:12:36,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-07 11:12:36,584 INFO L276 IsEmpty]: Start isEmpty. Operand 59550 states and 174345 transitions. [2019-12-07 11:12:36,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:12:36,648 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:12:36,648 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:12:36,648 INFO L410 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:12:36,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:12:36,648 INFO L82 PathProgramCache]: Analyzing trace with hash 431175959, now seen corresponding path program 105 times [2019-12-07 11:12:36,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:12:36,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570898344] [2019-12-07 11:12:36,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:12:36,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:12:37,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:12:37,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570898344] [2019-12-07 11:12:37,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:12:37,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-12-07 11:12:37,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836877346] [2019-12-07 11:12:37,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-07 11:12:37,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:12:37,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-07 11:12:37,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=498, Unknown=0, NotChecked=0, Total=552 [2019-12-07 11:12:37,243 INFO L87 Difference]: Start difference. First operand 59550 states and 174345 transitions. Second operand 24 states. [2019-12-07 11:12:40,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:12:40,859 INFO L93 Difference]: Finished difference Result 68058 states and 198078 transitions. [2019-12-07 11:12:40,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-07 11:12:40,859 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 72 [2019-12-07 11:12:40,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:12:40,942 INFO L225 Difference]: With dead ends: 68058 [2019-12-07 11:12:40,942 INFO L226 Difference]: Without dead ends: 66174 [2019-12-07 11:12:40,942 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=213, Invalid=1949, Unknown=0, NotChecked=0, Total=2162 [2019-12-07 11:12:41,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66174 states. [2019-12-07 11:12:41,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66174 to 60361. [2019-12-07 11:12:41,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60361 states. [2019-12-07 11:12:41,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60361 states to 60361 states and 176702 transitions. [2019-12-07 11:12:41,857 INFO L78 Accepts]: Start accepts. Automaton has 60361 states and 176702 transitions. Word has length 72 [2019-12-07 11:12:41,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:12:41,858 INFO L462 AbstractCegarLoop]: Abstraction has 60361 states and 176702 transitions. [2019-12-07 11:12:41,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-07 11:12:41,858 INFO L276 IsEmpty]: Start isEmpty. Operand 60361 states and 176702 transitions. [2019-12-07 11:12:41,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:12:41,921 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:12:41,921 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:12:41,921 INFO L410 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:12:41,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:12:41,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1503603901, now seen corresponding path program 106 times [2019-12-07 11:12:41,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:12:41,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086481736] [2019-12-07 11:12:41,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:12:41,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:12:42,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:12:42,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086481736] [2019-12-07 11:12:42,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:12:42,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-07 11:12:42,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501015813] [2019-12-07 11:12:42,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 11:12:42,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:12:42,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 11:12:42,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-12-07 11:12:42,314 INFO L87 Difference]: Start difference. First operand 60361 states and 176702 transitions. Second operand 18 states. [2019-12-07 11:12:44,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:12:44,061 INFO L93 Difference]: Finished difference Result 64395 states and 187276 transitions. [2019-12-07 11:12:44,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 11:12:44,061 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 72 [2019-12-07 11:12:44,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:12:44,153 INFO L225 Difference]: With dead ends: 64395 [2019-12-07 11:12:44,153 INFO L226 Difference]: Without dead ends: 63969 [2019-12-07 11:12:44,153 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=869, Unknown=0, NotChecked=0, Total=992 [2019-12-07 11:12:44,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63969 states. [2019-12-07 11:12:44,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63969 to 60337. [2019-12-07 11:12:44,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60337 states. [2019-12-07 11:12:45,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60337 states to 60337 states and 176630 transitions. [2019-12-07 11:12:45,012 INFO L78 Accepts]: Start accepts. Automaton has 60337 states and 176630 transitions. Word has length 72 [2019-12-07 11:12:45,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:12:45,013 INFO L462 AbstractCegarLoop]: Abstraction has 60337 states and 176630 transitions. [2019-12-07 11:12:45,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 11:12:45,013 INFO L276 IsEmpty]: Start isEmpty. Operand 60337 states and 176630 transitions. [2019-12-07 11:12:45,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:12:45,076 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:12:45,077 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:12:45,077 INFO L410 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:12:45,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:12:45,077 INFO L82 PathProgramCache]: Analyzing trace with hash -2063606819, now seen corresponding path program 107 times [2019-12-07 11:12:45,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:12:45,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396510162] [2019-12-07 11:12:45,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:12:45,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:12:45,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:12:45,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396510162] [2019-12-07 11:12:45,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:12:45,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 11:12:45,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125611457] [2019-12-07 11:12:45,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 11:12:45,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:12:45,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 11:12:45,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2019-12-07 11:12:45,365 INFO L87 Difference]: Start difference. First operand 60337 states and 176630 transitions. Second operand 16 states. [2019-12-07 11:12:48,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:12:48,389 INFO L93 Difference]: Finished difference Result 64768 states and 189190 transitions. [2019-12-07 11:12:48,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 11:12:48,390 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 72 [2019-12-07 11:12:48,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:12:48,470 INFO L225 Difference]: With dead ends: 64768 [2019-12-07 11:12:48,471 INFO L226 Difference]: Without dead ends: 62930 [2019-12-07 11:12:48,471 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=135, Invalid=857, Unknown=0, NotChecked=0, Total=992 [2019-12-07 11:12:48,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62930 states. [2019-12-07 11:12:49,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62930 to 60029. [2019-12-07 11:12:49,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60029 states. [2019-12-07 11:12:49,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60029 states to 60029 states and 175678 transitions. [2019-12-07 11:12:49,330 INFO L78 Accepts]: Start accepts. Automaton has 60029 states and 175678 transitions. Word has length 72 [2019-12-07 11:12:49,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:12:49,331 INFO L462 AbstractCegarLoop]: Abstraction has 60029 states and 175678 transitions. [2019-12-07 11:12:49,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 11:12:49,331 INFO L276 IsEmpty]: Start isEmpty. Operand 60029 states and 175678 transitions. [2019-12-07 11:12:49,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:12:49,395 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:12:49,395 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:12:49,395 INFO L410 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:12:49,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:12:49,395 INFO L82 PathProgramCache]: Analyzing trace with hash 460116567, now seen corresponding path program 108 times [2019-12-07 11:12:49,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:12:49,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145095318] [2019-12-07 11:12:49,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:12:49,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:12:49,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:12:49,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145095318] [2019-12-07 11:12:49,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:12:49,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-07 11:12:49,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859488118] [2019-12-07 11:12:49,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 11:12:49,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:12:49,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 11:12:49,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-12-07 11:12:49,743 INFO L87 Difference]: Start difference. First operand 60029 states and 175678 transitions. Second operand 18 states. [2019-12-07 11:12:51,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:12:51,439 INFO L93 Difference]: Finished difference Result 65786 states and 192366 transitions. [2019-12-07 11:12:51,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 11:12:51,439 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 72 [2019-12-07 11:12:51,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:12:51,521 INFO L225 Difference]: With dead ends: 65786 [2019-12-07 11:12:51,521 INFO L226 Difference]: Without dead ends: 65582 [2019-12-07 11:12:51,521 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=819, Unknown=0, NotChecked=0, Total=930 [2019-12-07 11:12:51,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65582 states. [2019-12-07 11:12:52,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65582 to 61546. [2019-12-07 11:12:52,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61546 states. [2019-12-07 11:12:52,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61546 states to 61546 states and 180196 transitions. [2019-12-07 11:12:52,445 INFO L78 Accepts]: Start accepts. Automaton has 61546 states and 180196 transitions. Word has length 72 [2019-12-07 11:12:52,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:12:52,445 INFO L462 AbstractCegarLoop]: Abstraction has 61546 states and 180196 transitions. [2019-12-07 11:12:52,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 11:12:52,445 INFO L276 IsEmpty]: Start isEmpty. Operand 61546 states and 180196 transitions. [2019-12-07 11:12:52,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:12:52,510 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:12:52,510 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:12:52,510 INFO L410 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:12:52,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:12:52,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1361715917, now seen corresponding path program 109 times [2019-12-07 11:12:52,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:12:52,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424696036] [2019-12-07 11:12:52,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:12:52,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:12:52,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:12:52,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424696036] [2019-12-07 11:12:52,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:12:52,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-07 11:12:52,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992150923] [2019-12-07 11:12:52,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 11:12:52,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:12:52,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 11:12:52,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-12-07 11:12:52,832 INFO L87 Difference]: Start difference. First operand 61546 states and 180196 transitions. Second operand 18 states. [2019-12-07 11:12:56,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:12:56,439 INFO L93 Difference]: Finished difference Result 67827 states and 197670 transitions. [2019-12-07 11:12:56,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-07 11:12:56,439 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 72 [2019-12-07 11:12:56,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:12:56,521 INFO L225 Difference]: With dead ends: 67827 [2019-12-07 11:12:56,521 INFO L226 Difference]: Without dead ends: 64217 [2019-12-07 11:12:56,521 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=142, Invalid=1048, Unknown=0, NotChecked=0, Total=1190 [2019-12-07 11:12:56,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64217 states. [2019-12-07 11:12:57,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64217 to 59432. [2019-12-07 11:12:57,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59432 states. [2019-12-07 11:12:57,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59432 states to 59432 states and 173897 transitions. [2019-12-07 11:12:57,373 INFO L78 Accepts]: Start accepts. Automaton has 59432 states and 173897 transitions. Word has length 72 [2019-12-07 11:12:57,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:12:57,373 INFO L462 AbstractCegarLoop]: Abstraction has 59432 states and 173897 transitions. [2019-12-07 11:12:57,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 11:12:57,373 INFO L276 IsEmpty]: Start isEmpty. Operand 59432 states and 173897 transitions. [2019-12-07 11:12:57,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:12:57,436 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:12:57,436 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:12:57,436 INFO L410 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:12:57,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:12:57,436 INFO L82 PathProgramCache]: Analyzing trace with hash -227155599, now seen corresponding path program 110 times [2019-12-07 11:12:57,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:12:57,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46492280] [2019-12-07 11:12:57,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:12:57,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:12:57,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:12:57,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46492280] [2019-12-07 11:12:57,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:12:57,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-07 11:12:57,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817372096] [2019-12-07 11:12:57,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 11:12:57,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:12:57,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 11:12:57,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2019-12-07 11:12:57,777 INFO L87 Difference]: Start difference. First operand 59432 states and 173897 transitions. Second operand 18 states. [2019-12-07 11:12:59,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:12:59,172 INFO L93 Difference]: Finished difference Result 61832 states and 179805 transitions. [2019-12-07 11:12:59,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 11:12:59,172 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 72 [2019-12-07 11:12:59,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:12:59,254 INFO L225 Difference]: With dead ends: 61832 [2019-12-07 11:12:59,254 INFO L226 Difference]: Without dead ends: 61518 [2019-12-07 11:12:59,254 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=762, Unknown=0, NotChecked=0, Total=870 [2019-12-07 11:12:59,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61518 states. [2019-12-07 11:12:59,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61518 to 59404. [2019-12-07 11:12:59,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59404 states. [2019-12-07 11:13:00,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59404 states to 59404 states and 173827 transitions. [2019-12-07 11:13:00,083 INFO L78 Accepts]: Start accepts. Automaton has 59404 states and 173827 transitions. Word has length 72 [2019-12-07 11:13:00,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:13:00,084 INFO L462 AbstractCegarLoop]: Abstraction has 59404 states and 173827 transitions. [2019-12-07 11:13:00,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 11:13:00,084 INFO L276 IsEmpty]: Start isEmpty. Operand 59404 states and 173827 transitions. [2019-12-07 11:13:00,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 11:13:00,146 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:13:00,146 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:13:00,147 INFO L410 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:13:00,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:13:00,147 INFO L82 PathProgramCache]: Analyzing trace with hash 959991305, now seen corresponding path program 111 times [2019-12-07 11:13:00,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:13:00,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724217054] [2019-12-07 11:13:00,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:13:00,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:13:00,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:13:00,240 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 11:13:00,240 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 11:13:00,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1160] [1160] ULTIMATE.startENTRY-->L838: Formula: (let ((.cse1 (store |v_#valid_73| 0 0))) (let ((.cse0 (store .cse1 |v_~#x~0.base_244| 1))) (and (< |v_#StackHeapBarrier_24| |v_ULTIMATE.start_main_~#t2464~0.base_22|) (= |v_#valid_71| (store .cse0 |v_ULTIMATE.start_main_~#t2464~0.base_22| 1)) (= v_~__unbuffered_cnt~0_104 0) (= 0 v_~x$r_buff0_thd3~0_278) (= 0 v_~__unbuffered_p2_EAX$r_buff0_thd1~0_8) (= v_~main$tmp_guard1~0_31 0) (= |v_#NULL.offset_6| 0) (= 0 v_~__unbuffered_p2_EAX$w_buff0~0_7) (= (select (select |v_#memory_int_395| |v_~#x~0.base_244|) |v_~#x~0.offset_244|) 0) (= v_~x$r_buff1_thd0~0_77 0) (= 0 v_~__unbuffered_p2_EAX$r_buff0_thd2~0_8) (= 0 v_~__unbuffered_p2_EAX$w_buff0_used~0_7) (= 0 v_~__unbuffered_p2_EAX$w_buff1~0_7) (= 0 v_~x$w_buff1~0_137) (= 0 |v_~#x~0.offset_244|) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~__unbuffered_p0_EAX~0_70) (= v_~x$r_buff1_thd2~0_55 0) (= 0 v_~__unbuffered_p2_EAX$r_buff0_thd3~0_6) (= v_~weak$$choice2~0_140 0) (= 0 v_~x$read_delayed~0_8) (= v_~x$mem_tmp~0_82 0) (= v_~__unbuffered_p2_EBX~0_33 0) (= 0 v_~x$r_buff0_thd0~0_89) (= 0 v_~x$w_buff1_used~0_483) (= 0 v_~__unbuffered_p2_EAX$mem_tmp~0_8) (= v_~main$tmp_guard0~0_33 0) (= 0 v_~x$w_buff0~0_164) (= 0 v_~x$r_buff1_thd3~0_181) (= v_~y~0_51 0) (= 0 v_~x$read_delayed_var~0.offset_7) (< |v_#StackHeapBarrier_24| |v_~#x~0.base_244|) (= 0 v_~x$w_buff0_used~0_778) (= v_~x$r_buff0_thd1~0_285 0) (= 0 v_~__unbuffered_p2_EAX$r_buff1_thd1~0_7) (= |v_#length_36| (store (store |v_#length_37| |v_~#x~0.base_244| 4) |v_ULTIMATE.start_main_~#t2464~0.base_22| 4)) (= (store |v_#memory_int_395| |v_ULTIMATE.start_main_~#t2464~0.base_22| (store (select |v_#memory_int_395| |v_ULTIMATE.start_main_~#t2464~0.base_22|) |v_ULTIMATE.start_main_~#t2464~0.offset_17| 0)) |v_#memory_int_394|) (< 0 |v_#StackHeapBarrier_24|) (= 0 v_~__unbuffered_p2_EAX$flush_delayed~0_7) (= 0 (select .cse1 |v_~#x~0.base_244|)) (= 0 v_~__unbuffered_p2_EAX$r_buff1_thd2~0_7) (= 0 v_~__unbuffered_p2_EAX~0_77) (= 0 v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_44) (= 0 v_~__unbuffered_p2_EAX$r_buff1_thd0~0_6) (= 0 v_~__unbuffered_p2_EAX$w_buff1_used~0_7) (= 0 v_~weak$$choice0~0_74) (= 0 v_~weak$$choice1~0_28) (= v_~__unbuffered_p2_EAX$read_delayed~0_57 0) (= 0 |v_#NULL.base_6|) (= 0 v_~__unbuffered_p2_EAX$read_delayed_var~0.base_44) (= 0 v_~__unbuffered_p2_EAX$r_buff0_thd0~0_8) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2464~0.base_22|)) (= v_~x$r_buff1_thd1~0_182 0) (= v_~x$flush_delayed~0_108 0) (= 0 |v_ULTIMATE.start_main_~#t2464~0.offset_17|) (= 0 v_~__unbuffered_p2_EAX$r_buff1_thd3~0_7) (= 0 v_~x$r_buff0_thd2~0_71)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_24|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_395|, #length=|v_#length_37|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_164, ~x$flush_delayed~0=v_~x$flush_delayed~0_108, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_44, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_44, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_182, ULTIMATE.start_main_~#t2464~0.base=|v_ULTIMATE.start_main_~#t2464~0.base_22|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_278, ULTIMATE.start_main_#t~nondet72=|v_ULTIMATE.start_main_#t~nondet72_7|, ULTIMATE.start_main_~#t2466~0.offset=|v_ULTIMATE.start_main_~#t2466~0.offset_21|, ~weak$$choice1~0=v_~weak$$choice1~0_28, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_70, ~__unbuffered_p2_EAX$w_buff0_used~0=v_~__unbuffered_p2_EAX$w_buff0_used~0_7, #length=|v_#length_36|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_77, ~__unbuffered_p2_EAX$r_buff1_thd2~0=v_~__unbuffered_p2_EAX$r_buff1_thd2~0_7, ~__unbuffered_p2_EAX$r_buff0_thd0~0=v_~__unbuffered_p2_EAX$r_buff0_thd0~0_8, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_89, ~__unbuffered_p2_EAX$w_buff0~0=v_~__unbuffered_p2_EAX$w_buff0~0_7, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_33, ~#x~0.offset=|v_~#x~0.offset_244|, ~x$w_buff1~0=v_~x$w_buff1~0_137, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_483, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_55, ULTIMATE.start_main_#t~ite79=|v_ULTIMATE.start_main_#t~ite79_21|, ULTIMATE.start_main_#t~ite77=|v_ULTIMATE.start_main_#t~ite77_115|, ULTIMATE.start_main_#t~ite75=|v_ULTIMATE.start_main_#t~ite75_21|, ULTIMATE.start_main_#t~nondet81=|v_ULTIMATE.start_main_#t~nondet81_33|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ULTIMATE.start_main_~#t2464~0.offset=|v_ULTIMATE.start_main_~#t2464~0.offset_17|, ULTIMATE.start_main_#t~ite84=|v_ULTIMATE.start_main_#t~ite84_51|, ~weak$$choice0~0=v_~weak$$choice0~0_74, #StackHeapBarrier=|v_#StackHeapBarrier_24|, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_32|, ~__unbuffered_p2_EAX$r_buff0_thd1~0=v_~__unbuffered_p2_EAX$r_buff0_thd1~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_104, ULTIMATE.start_main_~#t2466~0.base=|v_ULTIMATE.start_main_~#t2466~0.base_24|, ~__unbuffered_p2_EAX$r_buff1_thd3~0=v_~__unbuffered_p2_EAX$r_buff1_thd3~0_7, ~__unbuffered_p2_EAX$w_buff1~0=v_~__unbuffered_p2_EAX$w_buff1~0_7, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_285, ULTIMATE.start_main_#t~nondet73=|v_ULTIMATE.start_main_#t~nondet73_20|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_181, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_82, ULTIMATE.start_main_#t~nondet71=|v_ULTIMATE.start_main_#t~nondet71_8|, ULTIMATE.start_main_~#t2465~0.base=|v_ULTIMATE.start_main_~#t2465~0.base_31|, ~__unbuffered_p2_EAX$w_buff1_used~0=v_~__unbuffered_p2_EAX$w_buff1_used~0_7, ~__unbuffered_p2_EAX$r_buff0_thd2~0=v_~__unbuffered_p2_EAX$r_buff0_thd2~0_8, ~__unbuffered_p2_EAX$r_buff1_thd0~0=v_~__unbuffered_p2_EAX$r_buff1_thd0~0_6, ~y~0=v_~y~0_51, ULTIMATE.start_main_~#t2465~0.offset=|v_ULTIMATE.start_main_~#t2465~0.offset_28|, ULTIMATE.start_main_#t~mem74=|v_ULTIMATE.start_main_#t~mem74_20|, ~__unbuffered_p2_EAX$mem_tmp~0=v_~__unbuffered_p2_EAX$mem_tmp~0_8, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_33, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_77, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_71, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_299|, ~__unbuffered_p2_EAX$flush_delayed~0=v_~__unbuffered_p2_EAX$flush_delayed~0_7, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite76=|v_ULTIMATE.start_main_#t~ite76_24|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_778, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_57, ULTIMATE.start_main_#t~ite83=|v_ULTIMATE.start_main_#t~ite83_50|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_71|, ULTIMATE.start_main_#t~mem82=|v_ULTIMATE.start_main_#t~mem82_37|, #memory_int=|v_#memory_int_394|, ~#x~0.base=|v_~#x~0.base_244|, ~__unbuffered_p2_EAX$r_buff1_thd1~0=v_~__unbuffered_p2_EAX$r_buff1_thd1~0_7, ~__unbuffered_p2_EAX$r_buff0_thd3~0=v_~__unbuffered_p2_EAX$r_buff0_thd3~0_6, ~weak$$choice2~0=v_~weak$$choice2~0_140, ~x$read_delayed~0=v_~x$read_delayed~0_8} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, ~__unbuffered_p2_EAX$read_delayed_var~0.offset, ~__unbuffered_p2_EAX$read_delayed_var~0.base, #NULL.offset, ~x$r_buff1_thd1~0, ULTIMATE.start_main_~#t2464~0.base, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet72, ULTIMATE.start_main_~#t2466~0.offset, ~weak$$choice1~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p2_EAX$w_buff0_used~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EAX$r_buff1_thd2~0, ~__unbuffered_p2_EAX$r_buff0_thd0~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EAX$w_buff0~0, ~__unbuffered_p2_EBX~0, ~#x~0.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite79, ULTIMATE.start_main_#t~ite77, ULTIMATE.start_main_#t~ite75, ULTIMATE.start_main_#t~nondet81, ~x$read_delayed_var~0.base, ULTIMATE.start_main_~#t2464~0.offset, ULTIMATE.start_main_#t~ite84, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite80, ~__unbuffered_p2_EAX$r_buff0_thd1~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t2466~0.base, ~__unbuffered_p2_EAX$r_buff1_thd3~0, ~__unbuffered_p2_EAX$w_buff1~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet73, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~nondet71, ULTIMATE.start_main_~#t2465~0.base, ~__unbuffered_p2_EAX$w_buff1_used~0, ~__unbuffered_p2_EAX$r_buff0_thd2~0, ~__unbuffered_p2_EAX$r_buff1_thd0~0, ~y~0, ULTIMATE.start_main_~#t2465~0.offset, ULTIMATE.start_main_#t~mem74, ~__unbuffered_p2_EAX$mem_tmp~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite78, ~__unbuffered_p2_EAX$flush_delayed~0, #NULL.base, ULTIMATE.start_main_#t~ite76, ~x$w_buff0_used~0, ~__unbuffered_p2_EAX$read_delayed~0, ULTIMATE.start_main_#t~ite83, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem82, #memory_int, ~#x~0.base, ~__unbuffered_p2_EAX$r_buff1_thd1~0, ~__unbuffered_p2_EAX$r_buff0_thd3~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 11:13:00,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1126] [1126] L838-1-->L840: Formula: (and (= (store |v_#memory_int_282| |v_ULTIMATE.start_main_~#t2465~0.base_23| (store (select |v_#memory_int_282| |v_ULTIMATE.start_main_~#t2465~0.base_23|) |v_ULTIMATE.start_main_~#t2465~0.offset_22| 1)) |v_#memory_int_281|) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t2465~0.base_23| 1)) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t2465~0.base_23|)) (not (= |v_ULTIMATE.start_main_~#t2465~0.base_23| 0)) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t2465~0.base_23| 4)) (= 0 |v_ULTIMATE.start_main_~#t2465~0.offset_22|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t2465~0.base_23|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_282|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t2465~0.base=|v_ULTIMATE.start_main_~#t2465~0.base_23|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_281|, #length=|v_#length_21|, ULTIMATE.start_main_#t~nondet71=|v_ULTIMATE.start_main_#t~nondet71_4|, ULTIMATE.start_main_~#t2465~0.offset=|v_ULTIMATE.start_main_~#t2465~0.offset_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2465~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet71, ULTIMATE.start_main_~#t2465~0.offset] because there is no mapped edge [2019-12-07 11:13:00,244 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1125] [1125] L840-1-->L842: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t2466~0.base_14|)) (= 0 |v_ULTIMATE.start_main_~#t2466~0.offset_14|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t2466~0.base_14|) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t2466~0.base_14| 1)) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t2466~0.base_14| 4)) (= |v_#memory_int_279| (store |v_#memory_int_280| |v_ULTIMATE.start_main_~#t2466~0.base_14| (store (select |v_#memory_int_280| |v_ULTIMATE.start_main_~#t2466~0.base_14|) |v_ULTIMATE.start_main_~#t2466~0.offset_14| 2))) (= (select |v_#valid_34| |v_ULTIMATE.start_main_~#t2466~0.base_14|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_280|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_279|, #length=|v_#length_19|, ULTIMATE.start_main_~#t2466~0.base=|v_ULTIMATE.start_main_~#t2466~0.base_14|, ULTIMATE.start_main_#t~nondet72=|v_ULTIMATE.start_main_#t~nondet72_3|, ULTIMATE.start_main_~#t2466~0.offset=|v_ULTIMATE.start_main_~#t2466~0.offset_14|} AuxVars[] AssignedVars[#valid, #memory_int, #length, ULTIMATE.start_main_~#t2466~0.base, ULTIMATE.start_main_#t~nondet72, ULTIMATE.start_main_~#t2466~0.offset] because there is no mapped edge [2019-12-07 11:13:00,247 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1087] [1087] L780-2-->L780-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-934270306 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd2~0_In-934270306 256) 0))) (or (and (or .cse0 .cse1) (= (select (select |#memory_int_In-934270306| |~#x~0.base_In-934270306|) |~#x~0.offset_In-934270306|) |P1Thread1of1ForFork1_#t~mem30_Out-934270306|) (= |P1Thread1of1ForFork1_#t~mem30_Out-934270306| |P1Thread1of1ForFork1_#t~ite31_Out-934270306|)) (and (= |P1Thread1of1ForFork1_#t~mem30_In-934270306| |P1Thread1of1ForFork1_#t~mem30_Out-934270306|) (not .cse1) (not .cse0) (= ~x$w_buff1~0_In-934270306 |P1Thread1of1ForFork1_#t~ite31_Out-934270306|)))) InVars {P1Thread1of1ForFork1_#t~mem30=|P1Thread1of1ForFork1_#t~mem30_In-934270306|, ~#x~0.offset=|~#x~0.offset_In-934270306|, ~x$w_buff1~0=~x$w_buff1~0_In-934270306, ~#x~0.base=|~#x~0.base_In-934270306|, #memory_int=|#memory_int_In-934270306|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-934270306, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-934270306} OutVars{P1Thread1of1ForFork1_#t~mem30=|P1Thread1of1ForFork1_#t~mem30_Out-934270306|, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out-934270306|, ~#x~0.offset=|~#x~0.offset_In-934270306|, ~x$w_buff1~0=~x$w_buff1~0_In-934270306, ~#x~0.base=|~#x~0.base_In-934270306|, #memory_int=|#memory_int_In-934270306|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-934270306, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-934270306} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~mem30, P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 11:13:00,247 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1014] [1014] L780-4-->L781: Formula: (= (store |v_#memory_int_69| |v_~#x~0.base_42| (store (select |v_#memory_int_69| |v_~#x~0.base_42|) |v_~#x~0.offset_42| |v_P1Thread1of1ForFork1_#t~ite31_6|)) |v_#memory_int_68|) InVars {~#x~0.offset=|v_~#x~0.offset_42|, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_6|, #memory_int=|v_#memory_int_69|, ~#x~0.base=|v_~#x~0.base_42|} OutVars{P1Thread1of1ForFork1_#t~mem30=|v_P1Thread1of1ForFork1_#t~mem30_3|, ~#x~0.offset=|v_~#x~0.offset_42|, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, #memory_int=|v_#memory_int_68|, ~#x~0.base=|v_~#x~0.base_42|, P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~mem30, P1Thread1of1ForFork1_#t~ite31, #memory_int, P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 11:13:00,247 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1084] [1084] L781-->L781-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1787847496 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In1787847496 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1787847496 |P1Thread1of1ForFork1_#t~ite33_Out1787847496|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite33_Out1787847496|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1787847496, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1787847496} OutVars{P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out1787847496|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1787847496, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1787847496} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-07 11:13:00,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1081] [1081] L782-->L782-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-547800546 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In-547800546 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-547800546 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-547800546 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out-547800546| ~x$w_buff1_used~0_In-547800546) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-547800546|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-547800546, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-547800546, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-547800546, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-547800546} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-547800546|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-547800546, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-547800546, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-547800546, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-547800546} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 11:13:00,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1093] [1093] L783-->L784: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1208642457 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1208642457 256))) (.cse2 (= ~x$r_buff0_thd2~0_Out-1208642457 ~x$r_buff0_thd2~0_In-1208642457))) (or (and (= ~x$r_buff0_thd2~0_Out-1208642457 0) (not .cse0) (not .cse1)) (and .cse1 .cse2) (and .cse0 .cse2))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1208642457, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1208642457} OutVars{P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1208642457|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1208642457, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1208642457} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 11:13:00,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1097] [1097] L784-->L784-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In-843353825 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In-843353825 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-843353825 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-843353825 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite36_Out-843353825| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out-843353825| ~x$r_buff1_thd2~0_In-843353825)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-843353825, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-843353825, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-843353825, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-843353825} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-843353825, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-843353825, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-843353825, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-843353825|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-843353825} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 11:13:00,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1032] [1032] L803-->L804: Formula: (and (= v_~x$r_buff0_thd3~0_105 v_~x$r_buff0_thd3~0_104) (not (= (mod v_~weak$$choice2~0_77 256) 0))) InVars {~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_105, ~weak$$choice2~0=v_~weak$$choice2~0_77} OutVars{P2Thread1of1ForFork2_#t~ite56=|v_P2Thread1of1ForFork2_#t~ite56_9|, P2Thread1of1ForFork2_#t~ite57=|v_P2Thread1of1ForFork2_#t~ite57_9|, P2Thread1of1ForFork2_#t~ite55=|v_P2Thread1of1ForFork2_#t~ite55_10|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_104, ~weak$$choice2~0=v_~weak$$choice2~0_77} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite56, P2Thread1of1ForFork2_#t~ite57, P2Thread1of1ForFork2_#t~ite55, ~x$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 11:13:00,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1083] [1083] L808-->L808-2: Formula: (let ((.cse0 (= (mod ~x$flush_delayed~0_In1069033215 256) 0))) (or (and .cse0 (= (select (select |#memory_int_In1069033215| |~#x~0.base_In1069033215|) |~#x~0.offset_In1069033215|) |P2Thread1of1ForFork2_#t~mem62_Out1069033215|) (= |P2Thread1of1ForFork2_#t~ite63_Out1069033215| |P2Thread1of1ForFork2_#t~mem62_Out1069033215|)) (and (= |P2Thread1of1ForFork2_#t~ite63_Out1069033215| ~x$mem_tmp~0_In1069033215) (not .cse0) (= |P2Thread1of1ForFork2_#t~mem62_In1069033215| |P2Thread1of1ForFork2_#t~mem62_Out1069033215|)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In1069033215, ~#x~0.offset=|~#x~0.offset_In1069033215|, ~#x~0.base=|~#x~0.base_In1069033215|, #memory_int=|#memory_int_In1069033215|, ~x$mem_tmp~0=~x$mem_tmp~0_In1069033215, P2Thread1of1ForFork2_#t~mem62=|P2Thread1of1ForFork2_#t~mem62_In1069033215|} OutVars{~x$flush_delayed~0=~x$flush_delayed~0_In1069033215, ~#x~0.offset=|~#x~0.offset_In1069033215|, P2Thread1of1ForFork2_#t~ite63=|P2Thread1of1ForFork2_#t~ite63_Out1069033215|, ~#x~0.base=|~#x~0.base_In1069033215|, #memory_int=|#memory_int_In1069033215|, ~x$mem_tmp~0=~x$mem_tmp~0_In1069033215, P2Thread1of1ForFork2_#t~mem62=|P2Thread1of1ForFork2_#t~mem62_Out1069033215|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite63, P2Thread1of1ForFork2_#t~mem62] because there is no mapped edge [2019-12-07 11:13:00,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1079] [1079] L815-2-->L815-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In379408405 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In379408405 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite65_Out379408405| ~x$w_buff1~0_In379408405) (not .cse0) (= |P2Thread1of1ForFork2_#t~mem64_In379408405| |P2Thread1of1ForFork2_#t~mem64_Out379408405|) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite65_Out379408405| |P2Thread1of1ForFork2_#t~mem64_Out379408405|) (= |P2Thread1of1ForFork2_#t~mem64_Out379408405| (select (select |#memory_int_In379408405| |~#x~0.base_In379408405|) |~#x~0.offset_In379408405|))))) InVars {~#x~0.offset=|~#x~0.offset_In379408405|, ~x$w_buff1~0=~x$w_buff1~0_In379408405, ~#x~0.base=|~#x~0.base_In379408405|, #memory_int=|#memory_int_In379408405|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In379408405, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In379408405, P2Thread1of1ForFork2_#t~mem64=|P2Thread1of1ForFork2_#t~mem64_In379408405|} OutVars{P2Thread1of1ForFork2_#t~ite65=|P2Thread1of1ForFork2_#t~ite65_Out379408405|, ~#x~0.offset=|~#x~0.offset_In379408405|, ~x$w_buff1~0=~x$w_buff1~0_In379408405, ~#x~0.base=|~#x~0.base_In379408405|, #memory_int=|#memory_int_In379408405|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In379408405, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In379408405, P2Thread1of1ForFork2_#t~mem64=|P2Thread1of1ForFork2_#t~mem64_Out379408405|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite65, P2Thread1of1ForFork2_#t~mem64] because there is no mapped edge [2019-12-07 11:13:00,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1033] [1033] L815-4-->L816: Formula: (= (store |v_#memory_int_131| |v_~#x~0.base_85| (store (select |v_#memory_int_131| |v_~#x~0.base_85|) |v_~#x~0.offset_85| |v_P2Thread1of1ForFork2_#t~ite65_10|)) |v_#memory_int_130|) InVars {P2Thread1of1ForFork2_#t~ite65=|v_P2Thread1of1ForFork2_#t~ite65_10|, ~#x~0.offset=|v_~#x~0.offset_85|, #memory_int=|v_#memory_int_131|, ~#x~0.base=|v_~#x~0.base_85|} OutVars{P2Thread1of1ForFork2_#t~ite65=|v_P2Thread1of1ForFork2_#t~ite65_9|, P2Thread1of1ForFork2_#t~ite66=|v_P2Thread1of1ForFork2_#t~ite66_5|, ~#x~0.offset=|v_~#x~0.offset_85|, #memory_int=|v_#memory_int_130|, ~#x~0.base=|v_~#x~0.base_85|, P2Thread1of1ForFork2_#t~mem64=|v_P2Thread1of1ForFork2_#t~mem64_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite65, P2Thread1of1ForFork2_#t~ite66, #memory_int, P2Thread1of1ForFork2_#t~mem64] because there is no mapped edge [2019-12-07 11:13:00,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1086] [1086] L816-->L816-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In1315795223 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1315795223 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite67_Out1315795223| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite67_Out1315795223| ~x$w_buff0_used~0_In1315795223)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1315795223, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1315795223} OutVars{P2Thread1of1ForFork2_#t~ite67=|P2Thread1of1ForFork2_#t~ite67_Out1315795223|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1315795223, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1315795223} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite67] because there is no mapped edge [2019-12-07 11:13:00,257 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1095] [1095] L817-->L817-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-209691881 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-209691881 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-209691881 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd3~0_In-209691881 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-209691881 |P2Thread1of1ForFork2_#t~ite68_Out-209691881|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite68_Out-209691881|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-209691881, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-209691881, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-209691881, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-209691881} OutVars{P2Thread1of1ForFork2_#t~ite68=|P2Thread1of1ForFork2_#t~ite68_Out-209691881|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-209691881, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-209691881, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-209691881, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-209691881} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite68] because there is no mapped edge [2019-12-07 11:13:00,257 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1077] [1077] L818-->L819: Formula: (let ((.cse0 (= ~x$r_buff0_thd3~0_Out-854246549 ~x$r_buff0_thd3~0_In-854246549)) (.cse2 (= (mod ~x$r_buff0_thd3~0_In-854246549 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-854246549 256) 0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (not .cse2) (= ~x$r_buff0_thd3~0_Out-854246549 0) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-854246549, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-854246549} OutVars{P2Thread1of1ForFork2_#t~ite69=|P2Thread1of1ForFork2_#t~ite69_Out-854246549|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_Out-854246549, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-854246549} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite69, ~x$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 11:13:00,257 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1089] [1089] L819-->L819-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In491888055 256))) (.cse2 (= (mod ~x$r_buff1_thd3~0_In491888055 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In491888055 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In491888055 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite70_Out491888055|)) (and (= ~x$r_buff1_thd3~0_In491888055 |P2Thread1of1ForFork2_#t~ite70_Out491888055|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In491888055, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In491888055, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In491888055, ~x$w_buff0_used~0=~x$w_buff0_used~0_In491888055} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In491888055, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In491888055, P2Thread1of1ForFork2_#t~ite70=|P2Thread1of1ForFork2_#t~ite70_Out491888055|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In491888055, ~x$w_buff0_used~0=~x$w_buff0_used~0_In491888055} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite70] because there is no mapped edge [2019-12-07 11:13:00,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1122] [1122] L819-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#t~ite70_34| v_~x$r_buff1_thd3~0_127) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1))) InVars {P2Thread1of1ForFork2_#t~ite70=|v_P2Thread1of1ForFork2_#t~ite70_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} OutVars{~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_127, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, P2Thread1of1ForFork2_#t~ite70=|v_P2Thread1of1ForFork2_#t~ite70_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, P2Thread1of1ForFork2_#t~ite70, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 11:13:00,260 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1041] [1041] L761-->L762: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_97 256))) (= v_~x$r_buff0_thd1~0_107 v_~x$r_buff0_thd1~0_106)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_107, ~weak$$choice2~0=v_~weak$$choice2~0_97} OutVars{P0Thread1of1ForFork0_#t~ite22=|v_P0Thread1of1ForFork0_#t~ite22_7|, P0Thread1of1ForFork0_#t~ite21=|v_P0Thread1of1ForFork0_#t~ite21_9|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_106, ~weak$$choice2~0=v_~weak$$choice2~0_97, P0Thread1of1ForFork0_#t~ite23=|v_P0Thread1of1ForFork0_#t~ite23_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite22, P0Thread1of1ForFork0_#t~ite21, ~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite23] because there is no mapped edge [2019-12-07 11:13:00,261 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1075] [1075] L764-->L764-2: Formula: (let ((.cse0 (= (mod ~x$flush_delayed~0_In-2113853753 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~mem28_In-2113853753| |P0Thread1of1ForFork0_#t~mem28_Out-2113853753|) (= ~x$mem_tmp~0_In-2113853753 |P0Thread1of1ForFork0_#t~ite29_Out-2113853753|) (not .cse0)) (and (= |P0Thread1of1ForFork0_#t~mem28_Out-2113853753| |P0Thread1of1ForFork0_#t~ite29_Out-2113853753|) (= |P0Thread1of1ForFork0_#t~mem28_Out-2113853753| (select (select |#memory_int_In-2113853753| |~#x~0.base_In-2113853753|) |~#x~0.offset_In-2113853753|)) .cse0))) InVars {P0Thread1of1ForFork0_#t~mem28=|P0Thread1of1ForFork0_#t~mem28_In-2113853753|, ~x$flush_delayed~0=~x$flush_delayed~0_In-2113853753, ~#x~0.offset=|~#x~0.offset_In-2113853753|, ~#x~0.base=|~#x~0.base_In-2113853753|, #memory_int=|#memory_int_In-2113853753|, ~x$mem_tmp~0=~x$mem_tmp~0_In-2113853753} OutVars{P0Thread1of1ForFork0_#t~mem28=|P0Thread1of1ForFork0_#t~mem28_Out-2113853753|, ~x$flush_delayed~0=~x$flush_delayed~0_In-2113853753, ~#x~0.offset=|~#x~0.offset_In-2113853753|, P0Thread1of1ForFork0_#t~ite29=|P0Thread1of1ForFork0_#t~ite29_Out-2113853753|, ~#x~0.base=|~#x~0.base_In-2113853753|, #memory_int=|#memory_int_In-2113853753|, ~x$mem_tmp~0=~x$mem_tmp~0_In-2113853753} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~mem28, P0Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 11:13:00,261 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1117] [1117] L764-2-->P0EXIT: Formula: (and (= |v_#memory_int_248| (store |v_#memory_int_249| |v_~#x~0.base_160| (store (select |v_#memory_int_249| |v_~#x~0.base_160|) |v_~#x~0.offset_160| |v_P0Thread1of1ForFork0_#t~ite29_28|))) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~__unbuffered_cnt~0_49 (+ v_~__unbuffered_cnt~0_50 1)) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~x$flush_delayed~0_92 0)) InVars {~#x~0.offset=|v_~#x~0.offset_160|, P0Thread1of1ForFork0_#t~ite29=|v_P0Thread1of1ForFork0_#t~ite29_28|, #memory_int=|v_#memory_int_249|, ~#x~0.base=|v_~#x~0.base_160|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50} OutVars{P0Thread1of1ForFork0_#t~mem28=|v_P0Thread1of1ForFork0_#t~mem28_17|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, ~x$flush_delayed~0=v_~x$flush_delayed~0_92, ~#x~0.offset=|v_~#x~0.offset_160|, P0Thread1of1ForFork0_#t~ite29=|v_P0Thread1of1ForFork0_#t~ite29_27|, #memory_int=|v_#memory_int_248|, ~#x~0.base=|v_~#x~0.base_160|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~mem28, P0Thread1of1ForFork0_#res.offset, ~x$flush_delayed~0, P0Thread1of1ForFork0_#t~ite29, #memory_int, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 11:13:00,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1103] [1103] L784-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~x$r_buff1_thd2~0_28 |v_P1Thread1of1ForFork1_#t~ite36_22|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#t~ite36=|v_P1Thread1of1ForFork1_#t~ite36_22|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_28, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite36=|v_P1Thread1of1ForFork1_#t~ite36_21|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 11:13:00,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L846-->L848-2: Formula: (and (or (= (mod v_~x$w_buff0_used~0_118 256) 0) (= (mod v_~x$r_buff0_thd0~0_14 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 11:13:00,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1098] [1098] L848-2-->L848-5: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1697486263 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite76_Out-1697486263| |ULTIMATE.start_main_#t~ite75_Out-1697486263|)) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-1697486263 256) 0))) (or (and (or .cse0 .cse1) .cse2 (= |ULTIMATE.start_main_#t~mem74_Out-1697486263| (select (select |#memory_int_In-1697486263| |~#x~0.base_In-1697486263|) |~#x~0.offset_In-1697486263|)) (= |ULTIMATE.start_main_#t~mem74_Out-1697486263| |ULTIMATE.start_main_#t~ite75_Out-1697486263|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite75_Out-1697486263| ~x$w_buff1~0_In-1697486263) (= |ULTIMATE.start_main_#t~mem74_In-1697486263| |ULTIMATE.start_main_#t~mem74_Out-1697486263|) .cse2 (not .cse0)))) InVars {~#x~0.offset=|~#x~0.offset_In-1697486263|, ULTIMATE.start_main_#t~mem74=|ULTIMATE.start_main_#t~mem74_In-1697486263|, ~x$w_buff1~0=~x$w_buff1~0_In-1697486263, ~#x~0.base=|~#x~0.base_In-1697486263|, #memory_int=|#memory_int_In-1697486263|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1697486263, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1697486263} OutVars{ULTIMATE.start_main_#t~mem74=|ULTIMATE.start_main_#t~mem74_Out-1697486263|, ~#x~0.offset=|~#x~0.offset_In-1697486263|, ~x$w_buff1~0=~x$w_buff1~0_In-1697486263, ~#x~0.base=|~#x~0.base_In-1697486263|, #memory_int=|#memory_int_In-1697486263|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1697486263, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1697486263, ULTIMATE.start_main_#t~ite75=|ULTIMATE.start_main_#t~ite75_Out-1697486263|, ULTIMATE.start_main_#t~ite76=|ULTIMATE.start_main_#t~ite76_Out-1697486263|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem74, ULTIMATE.start_main_#t~ite75, ULTIMATE.start_main_#t~ite76] because there is no mapped edge [2019-12-07 11:13:00,263 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1080] [1080] L849-->L849-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1260253603 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1260253603 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite77_Out-1260253603| ~x$w_buff0_used~0_In-1260253603)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite77_Out-1260253603| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1260253603, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1260253603} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1260253603, ULTIMATE.start_main_#t~ite77=|ULTIMATE.start_main_#t~ite77_Out-1260253603|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1260253603} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite77] because there is no mapped edge [2019-12-07 11:13:00,263 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1082] [1082] L850-->L850-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In1035794751 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd0~0_In1035794751 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1035794751 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1035794751 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite78_Out1035794751|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~x$w_buff1_used~0_In1035794751 |ULTIMATE.start_main_#t~ite78_Out1035794751|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1035794751, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1035794751, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1035794751, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1035794751} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1035794751, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1035794751, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1035794751, ULTIMATE.start_main_#t~ite78=|ULTIMATE.start_main_#t~ite78_Out1035794751|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1035794751} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite78] because there is no mapped edge [2019-12-07 11:13:00,264 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1078] [1078] L851-->L852: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In722180138 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In722180138 256))) (.cse2 (= ~x$r_buff0_thd0~0_In722180138 ~x$r_buff0_thd0~0_Out722180138))) (or (and (not .cse0) (= ~x$r_buff0_thd0~0_Out722180138 0) (not .cse1)) (and .cse0 .cse2) (and .cse1 .cse2))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In722180138, ~x$w_buff0_used~0=~x$w_buff0_used~0_In722180138} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out722180138, ULTIMATE.start_main_#t~ite79=|ULTIMATE.start_main_#t~ite79_Out722180138|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In722180138} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite79] because there is no mapped edge [2019-12-07 11:13:00,264 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1096] [1096] L852-->L856: Formula: (let ((.cse3 (= ~x$r_buff1_thd0~0_Out148404098 ~x$r_buff1_thd0~0_In148404098)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In148404098 256))) (.cse4 (= 0 (mod ~x$w_buff0_used~0_In148404098 256))) (.cse0 (= |ULTIMATE.start_main_#t~nondet81_In148404098| ~weak$$choice1~0_Out148404098)) (.cse5 (= 0 (mod ~x$r_buff1_thd0~0_In148404098 256))) (.cse6 (= ~x$r_buff1_thd0~0_Out148404098 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In148404098 256) 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse5 .cse3) (and .cse0 .cse5 .cse3 .cse4) (and .cse0 (not .cse1) .cse6 (not .cse4)) (and .cse0 (not .cse5) .cse6 (not .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In148404098, ~x$w_buff1_used~0=~x$w_buff1_used~0_In148404098, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In148404098, ULTIMATE.start_main_#t~nondet81=|ULTIMATE.start_main_#t~nondet81_In148404098|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In148404098} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In148404098, ~weak$$choice1~0=~weak$$choice1~0_Out148404098, ULTIMATE.start_main_#t~ite80=|ULTIMATE.start_main_#t~ite80_Out148404098|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In148404098, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out148404098, ULTIMATE.start_main_#t~nondet81=|ULTIMATE.start_main_#t~nondet81_Out148404098|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In148404098} AuxVars[] AssignedVars[~weak$$choice1~0, ULTIMATE.start_main_#t~ite80, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet81] because there is no mapped edge [2019-12-07 11:13:00,264 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1069] [1069] L856-->L856-3: Formula: (let ((.cse1 (not (= (mod ~__unbuffered_p2_EAX$read_delayed~0_In1360496507 256) 0))) (.cse0 (= 0 (mod ~weak$$choice1~0_In1360496507 256)))) (or (and (= (select (select |#memory_int_In1360496507| ~__unbuffered_p2_EAX$read_delayed_var~0.base_In1360496507) ~__unbuffered_p2_EAX$read_delayed_var~0.offset_In1360496507) |ULTIMATE.start_main_#t~mem82_Out1360496507|) (= |ULTIMATE.start_main_#t~mem82_Out1360496507| |ULTIMATE.start_main_#t~ite83_Out1360496507|) (not .cse0) .cse1) (and (= ~__unbuffered_p2_EAX~0_In1360496507 |ULTIMATE.start_main_#t~ite83_Out1360496507|) (= |ULTIMATE.start_main_#t~mem82_In1360496507| |ULTIMATE.start_main_#t~mem82_Out1360496507|) .cse1 .cse0))) InVars {~weak$$choice1~0=~weak$$choice1~0_In1360496507, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=~__unbuffered_p2_EAX$read_delayed_var~0.offset_In1360496507, ~__unbuffered_p2_EAX$read_delayed_var~0.base=~__unbuffered_p2_EAX$read_delayed_var~0.base_In1360496507, ULTIMATE.start_main_#t~mem82=|ULTIMATE.start_main_#t~mem82_In1360496507|, #memory_int=|#memory_int_In1360496507|, ~__unbuffered_p2_EAX~0=~__unbuffered_p2_EAX~0_In1360496507, ~__unbuffered_p2_EAX$read_delayed~0=~__unbuffered_p2_EAX$read_delayed~0_In1360496507} OutVars{ULTIMATE.start_main_#t~ite83=|ULTIMATE.start_main_#t~ite83_Out1360496507|, ~weak$$choice1~0=~weak$$choice1~0_In1360496507, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=~__unbuffered_p2_EAX$read_delayed_var~0.offset_In1360496507, ULTIMATE.start_main_#t~mem82=|ULTIMATE.start_main_#t~mem82_Out1360496507|, ~__unbuffered_p2_EAX$read_delayed_var~0.base=~__unbuffered_p2_EAX$read_delayed_var~0.base_In1360496507, #memory_int=|#memory_int_In1360496507|, ~__unbuffered_p2_EAX~0=~__unbuffered_p2_EAX~0_In1360496507, ~__unbuffered_p2_EAX$read_delayed~0=~__unbuffered_p2_EAX$read_delayed~0_In1360496507} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite83, ULTIMATE.start_main_#t~mem82] because there is no mapped edge [2019-12-07 11:13:00,264 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1130] [1130] L856-3-->L5: Formula: (and (= (mod v_~main$tmp_guard1~0_21 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (let ((.cse3 (= v_~__unbuffered_p2_EBX~0_21 0)) (.cse1 (= 1 v_~__unbuffered_p2_EAX~0_46)) (.cse0 (= v_~main$tmp_guard1~0_21 1)) (.cse4 (= 0 v_~__unbuffered_p0_EAX~0_48)) (.cse2 (= |v_ULTIMATE.start_main_#t~ite83_36| v_~__unbuffered_p2_EAX~0_46))) (or (and .cse0 (not .cse1) .cse2) (and .cse0 (not .cse3) .cse2) (and (= v_~main$tmp_guard1~0_21 0) .cse3 .cse1 .cse4 .cse2) (and .cse0 (not .cse4) .cse2)))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_48, ULTIMATE.start_main_#t~ite83=|v_ULTIMATE.start_main_#t~ite83_36|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_21} OutVars{ULTIMATE.start_main_#t~ite84=|v_ULTIMATE.start_main_#t~ite84_33|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_48, ULTIMATE.start_main_#t~ite83=|v_ULTIMATE.start_main_#t~ite83_35|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_21, ULTIMATE.start_main_#t~mem82=|v_ULTIMATE.start_main_#t~mem82_27|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_46, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite84, ULTIMATE.start_main_#t~ite83, ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~mem82, ~main$tmp_guard1~0, ~__unbuffered_p2_EAX~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 11:13:00,264 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1131] [1131] L5-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-07 11:13:00,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:13:00 BasicIcfg [2019-12-07 11:13:00,335 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:13:00,336 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:13:00,336 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:13:00,336 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:13:00,336 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:02:23" (3/4) ... [2019-12-07 11:13:00,338 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 11:13:00,338 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1160] [1160] ULTIMATE.startENTRY-->L838: Formula: (let ((.cse1 (store |v_#valid_73| 0 0))) (let ((.cse0 (store .cse1 |v_~#x~0.base_244| 1))) (and (< |v_#StackHeapBarrier_24| |v_ULTIMATE.start_main_~#t2464~0.base_22|) (= |v_#valid_71| (store .cse0 |v_ULTIMATE.start_main_~#t2464~0.base_22| 1)) (= v_~__unbuffered_cnt~0_104 0) (= 0 v_~x$r_buff0_thd3~0_278) (= 0 v_~__unbuffered_p2_EAX$r_buff0_thd1~0_8) (= v_~main$tmp_guard1~0_31 0) (= |v_#NULL.offset_6| 0) (= 0 v_~__unbuffered_p2_EAX$w_buff0~0_7) (= (select (select |v_#memory_int_395| |v_~#x~0.base_244|) |v_~#x~0.offset_244|) 0) (= v_~x$r_buff1_thd0~0_77 0) (= 0 v_~__unbuffered_p2_EAX$r_buff0_thd2~0_8) (= 0 v_~__unbuffered_p2_EAX$w_buff0_used~0_7) (= 0 v_~__unbuffered_p2_EAX$w_buff1~0_7) (= 0 v_~x$w_buff1~0_137) (= 0 |v_~#x~0.offset_244|) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~__unbuffered_p0_EAX~0_70) (= v_~x$r_buff1_thd2~0_55 0) (= 0 v_~__unbuffered_p2_EAX$r_buff0_thd3~0_6) (= v_~weak$$choice2~0_140 0) (= 0 v_~x$read_delayed~0_8) (= v_~x$mem_tmp~0_82 0) (= v_~__unbuffered_p2_EBX~0_33 0) (= 0 v_~x$r_buff0_thd0~0_89) (= 0 v_~x$w_buff1_used~0_483) (= 0 v_~__unbuffered_p2_EAX$mem_tmp~0_8) (= v_~main$tmp_guard0~0_33 0) (= 0 v_~x$w_buff0~0_164) (= 0 v_~x$r_buff1_thd3~0_181) (= v_~y~0_51 0) (= 0 v_~x$read_delayed_var~0.offset_7) (< |v_#StackHeapBarrier_24| |v_~#x~0.base_244|) (= 0 v_~x$w_buff0_used~0_778) (= v_~x$r_buff0_thd1~0_285 0) (= 0 v_~__unbuffered_p2_EAX$r_buff1_thd1~0_7) (= |v_#length_36| (store (store |v_#length_37| |v_~#x~0.base_244| 4) |v_ULTIMATE.start_main_~#t2464~0.base_22| 4)) (= (store |v_#memory_int_395| |v_ULTIMATE.start_main_~#t2464~0.base_22| (store (select |v_#memory_int_395| |v_ULTIMATE.start_main_~#t2464~0.base_22|) |v_ULTIMATE.start_main_~#t2464~0.offset_17| 0)) |v_#memory_int_394|) (< 0 |v_#StackHeapBarrier_24|) (= 0 v_~__unbuffered_p2_EAX$flush_delayed~0_7) (= 0 (select .cse1 |v_~#x~0.base_244|)) (= 0 v_~__unbuffered_p2_EAX$r_buff1_thd2~0_7) (= 0 v_~__unbuffered_p2_EAX~0_77) (= 0 v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_44) (= 0 v_~__unbuffered_p2_EAX$r_buff1_thd0~0_6) (= 0 v_~__unbuffered_p2_EAX$w_buff1_used~0_7) (= 0 v_~weak$$choice0~0_74) (= 0 v_~weak$$choice1~0_28) (= v_~__unbuffered_p2_EAX$read_delayed~0_57 0) (= 0 |v_#NULL.base_6|) (= 0 v_~__unbuffered_p2_EAX$read_delayed_var~0.base_44) (= 0 v_~__unbuffered_p2_EAX$r_buff0_thd0~0_8) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2464~0.base_22|)) (= v_~x$r_buff1_thd1~0_182 0) (= v_~x$flush_delayed~0_108 0) (= 0 |v_ULTIMATE.start_main_~#t2464~0.offset_17|) (= 0 v_~__unbuffered_p2_EAX$r_buff1_thd3~0_7) (= 0 v_~x$r_buff0_thd2~0_71)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_24|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_395|, #length=|v_#length_37|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_164, ~x$flush_delayed~0=v_~x$flush_delayed~0_108, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_44, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_44, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_182, ULTIMATE.start_main_~#t2464~0.base=|v_ULTIMATE.start_main_~#t2464~0.base_22|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_278, ULTIMATE.start_main_#t~nondet72=|v_ULTIMATE.start_main_#t~nondet72_7|, ULTIMATE.start_main_~#t2466~0.offset=|v_ULTIMATE.start_main_~#t2466~0.offset_21|, ~weak$$choice1~0=v_~weak$$choice1~0_28, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_70, ~__unbuffered_p2_EAX$w_buff0_used~0=v_~__unbuffered_p2_EAX$w_buff0_used~0_7, #length=|v_#length_36|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_77, ~__unbuffered_p2_EAX$r_buff1_thd2~0=v_~__unbuffered_p2_EAX$r_buff1_thd2~0_7, ~__unbuffered_p2_EAX$r_buff0_thd0~0=v_~__unbuffered_p2_EAX$r_buff0_thd0~0_8, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_89, ~__unbuffered_p2_EAX$w_buff0~0=v_~__unbuffered_p2_EAX$w_buff0~0_7, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_33, ~#x~0.offset=|v_~#x~0.offset_244|, ~x$w_buff1~0=v_~x$w_buff1~0_137, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_483, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_55, ULTIMATE.start_main_#t~ite79=|v_ULTIMATE.start_main_#t~ite79_21|, ULTIMATE.start_main_#t~ite77=|v_ULTIMATE.start_main_#t~ite77_115|, ULTIMATE.start_main_#t~ite75=|v_ULTIMATE.start_main_#t~ite75_21|, ULTIMATE.start_main_#t~nondet81=|v_ULTIMATE.start_main_#t~nondet81_33|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ULTIMATE.start_main_~#t2464~0.offset=|v_ULTIMATE.start_main_~#t2464~0.offset_17|, ULTIMATE.start_main_#t~ite84=|v_ULTIMATE.start_main_#t~ite84_51|, ~weak$$choice0~0=v_~weak$$choice0~0_74, #StackHeapBarrier=|v_#StackHeapBarrier_24|, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_32|, ~__unbuffered_p2_EAX$r_buff0_thd1~0=v_~__unbuffered_p2_EAX$r_buff0_thd1~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_104, ULTIMATE.start_main_~#t2466~0.base=|v_ULTIMATE.start_main_~#t2466~0.base_24|, ~__unbuffered_p2_EAX$r_buff1_thd3~0=v_~__unbuffered_p2_EAX$r_buff1_thd3~0_7, ~__unbuffered_p2_EAX$w_buff1~0=v_~__unbuffered_p2_EAX$w_buff1~0_7, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_285, ULTIMATE.start_main_#t~nondet73=|v_ULTIMATE.start_main_#t~nondet73_20|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_181, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_82, ULTIMATE.start_main_#t~nondet71=|v_ULTIMATE.start_main_#t~nondet71_8|, ULTIMATE.start_main_~#t2465~0.base=|v_ULTIMATE.start_main_~#t2465~0.base_31|, ~__unbuffered_p2_EAX$w_buff1_used~0=v_~__unbuffered_p2_EAX$w_buff1_used~0_7, ~__unbuffered_p2_EAX$r_buff0_thd2~0=v_~__unbuffered_p2_EAX$r_buff0_thd2~0_8, ~__unbuffered_p2_EAX$r_buff1_thd0~0=v_~__unbuffered_p2_EAX$r_buff1_thd0~0_6, ~y~0=v_~y~0_51, ULTIMATE.start_main_~#t2465~0.offset=|v_ULTIMATE.start_main_~#t2465~0.offset_28|, ULTIMATE.start_main_#t~mem74=|v_ULTIMATE.start_main_#t~mem74_20|, ~__unbuffered_p2_EAX$mem_tmp~0=v_~__unbuffered_p2_EAX$mem_tmp~0_8, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_33, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_77, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_71, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_299|, ~__unbuffered_p2_EAX$flush_delayed~0=v_~__unbuffered_p2_EAX$flush_delayed~0_7, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite76=|v_ULTIMATE.start_main_#t~ite76_24|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_778, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_57, ULTIMATE.start_main_#t~ite83=|v_ULTIMATE.start_main_#t~ite83_50|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_71|, ULTIMATE.start_main_#t~mem82=|v_ULTIMATE.start_main_#t~mem82_37|, #memory_int=|v_#memory_int_394|, ~#x~0.base=|v_~#x~0.base_244|, ~__unbuffered_p2_EAX$r_buff1_thd1~0=v_~__unbuffered_p2_EAX$r_buff1_thd1~0_7, ~__unbuffered_p2_EAX$r_buff0_thd3~0=v_~__unbuffered_p2_EAX$r_buff0_thd3~0_6, ~weak$$choice2~0=v_~weak$$choice2~0_140, ~x$read_delayed~0=v_~x$read_delayed~0_8} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, ~__unbuffered_p2_EAX$read_delayed_var~0.offset, ~__unbuffered_p2_EAX$read_delayed_var~0.base, #NULL.offset, ~x$r_buff1_thd1~0, ULTIMATE.start_main_~#t2464~0.base, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet72, ULTIMATE.start_main_~#t2466~0.offset, ~weak$$choice1~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p2_EAX$w_buff0_used~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EAX$r_buff1_thd2~0, ~__unbuffered_p2_EAX$r_buff0_thd0~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EAX$w_buff0~0, ~__unbuffered_p2_EBX~0, ~#x~0.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite79, ULTIMATE.start_main_#t~ite77, ULTIMATE.start_main_#t~ite75, ULTIMATE.start_main_#t~nondet81, ~x$read_delayed_var~0.base, ULTIMATE.start_main_~#t2464~0.offset, ULTIMATE.start_main_#t~ite84, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite80, ~__unbuffered_p2_EAX$r_buff0_thd1~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t2466~0.base, ~__unbuffered_p2_EAX$r_buff1_thd3~0, ~__unbuffered_p2_EAX$w_buff1~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet73, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~nondet71, ULTIMATE.start_main_~#t2465~0.base, ~__unbuffered_p2_EAX$w_buff1_used~0, ~__unbuffered_p2_EAX$r_buff0_thd2~0, ~__unbuffered_p2_EAX$r_buff1_thd0~0, ~y~0, ULTIMATE.start_main_~#t2465~0.offset, ULTIMATE.start_main_#t~mem74, ~__unbuffered_p2_EAX$mem_tmp~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite78, ~__unbuffered_p2_EAX$flush_delayed~0, #NULL.base, ULTIMATE.start_main_#t~ite76, ~x$w_buff0_used~0, ~__unbuffered_p2_EAX$read_delayed~0, ULTIMATE.start_main_#t~ite83, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem82, #memory_int, ~#x~0.base, ~__unbuffered_p2_EAX$r_buff1_thd1~0, ~__unbuffered_p2_EAX$r_buff0_thd3~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 11:13:00,339 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1126] [1126] L838-1-->L840: Formula: (and (= (store |v_#memory_int_282| |v_ULTIMATE.start_main_~#t2465~0.base_23| (store (select |v_#memory_int_282| |v_ULTIMATE.start_main_~#t2465~0.base_23|) |v_ULTIMATE.start_main_~#t2465~0.offset_22| 1)) |v_#memory_int_281|) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t2465~0.base_23| 1)) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t2465~0.base_23|)) (not (= |v_ULTIMATE.start_main_~#t2465~0.base_23| 0)) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t2465~0.base_23| 4)) (= 0 |v_ULTIMATE.start_main_~#t2465~0.offset_22|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t2465~0.base_23|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_282|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t2465~0.base=|v_ULTIMATE.start_main_~#t2465~0.base_23|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_281|, #length=|v_#length_21|, ULTIMATE.start_main_#t~nondet71=|v_ULTIMATE.start_main_#t~nondet71_4|, ULTIMATE.start_main_~#t2465~0.offset=|v_ULTIMATE.start_main_~#t2465~0.offset_22|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2465~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet71, ULTIMATE.start_main_~#t2465~0.offset] because there is no mapped edge [2019-12-07 11:13:00,339 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1125] [1125] L840-1-->L842: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t2466~0.base_14|)) (= 0 |v_ULTIMATE.start_main_~#t2466~0.offset_14|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t2466~0.base_14|) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t2466~0.base_14| 1)) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t2466~0.base_14| 4)) (= |v_#memory_int_279| (store |v_#memory_int_280| |v_ULTIMATE.start_main_~#t2466~0.base_14| (store (select |v_#memory_int_280| |v_ULTIMATE.start_main_~#t2466~0.base_14|) |v_ULTIMATE.start_main_~#t2466~0.offset_14| 2))) (= (select |v_#valid_34| |v_ULTIMATE.start_main_~#t2466~0.base_14|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_280|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_279|, #length=|v_#length_19|, ULTIMATE.start_main_~#t2466~0.base=|v_ULTIMATE.start_main_~#t2466~0.base_14|, ULTIMATE.start_main_#t~nondet72=|v_ULTIMATE.start_main_#t~nondet72_3|, ULTIMATE.start_main_~#t2466~0.offset=|v_ULTIMATE.start_main_~#t2466~0.offset_14|} AuxVars[] AssignedVars[#valid, #memory_int, #length, ULTIMATE.start_main_~#t2466~0.base, ULTIMATE.start_main_#t~nondet72, ULTIMATE.start_main_~#t2466~0.offset] because there is no mapped edge [2019-12-07 11:13:00,342 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1087] [1087] L780-2-->L780-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-934270306 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd2~0_In-934270306 256) 0))) (or (and (or .cse0 .cse1) (= (select (select |#memory_int_In-934270306| |~#x~0.base_In-934270306|) |~#x~0.offset_In-934270306|) |P1Thread1of1ForFork1_#t~mem30_Out-934270306|) (= |P1Thread1of1ForFork1_#t~mem30_Out-934270306| |P1Thread1of1ForFork1_#t~ite31_Out-934270306|)) (and (= |P1Thread1of1ForFork1_#t~mem30_In-934270306| |P1Thread1of1ForFork1_#t~mem30_Out-934270306|) (not .cse1) (not .cse0) (= ~x$w_buff1~0_In-934270306 |P1Thread1of1ForFork1_#t~ite31_Out-934270306|)))) InVars {P1Thread1of1ForFork1_#t~mem30=|P1Thread1of1ForFork1_#t~mem30_In-934270306|, ~#x~0.offset=|~#x~0.offset_In-934270306|, ~x$w_buff1~0=~x$w_buff1~0_In-934270306, ~#x~0.base=|~#x~0.base_In-934270306|, #memory_int=|#memory_int_In-934270306|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-934270306, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-934270306} OutVars{P1Thread1of1ForFork1_#t~mem30=|P1Thread1of1ForFork1_#t~mem30_Out-934270306|, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out-934270306|, ~#x~0.offset=|~#x~0.offset_In-934270306|, ~x$w_buff1~0=~x$w_buff1~0_In-934270306, ~#x~0.base=|~#x~0.base_In-934270306|, #memory_int=|#memory_int_In-934270306|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-934270306, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-934270306} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~mem30, P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 11:13:00,342 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1014] [1014] L780-4-->L781: Formula: (= (store |v_#memory_int_69| |v_~#x~0.base_42| (store (select |v_#memory_int_69| |v_~#x~0.base_42|) |v_~#x~0.offset_42| |v_P1Thread1of1ForFork1_#t~ite31_6|)) |v_#memory_int_68|) InVars {~#x~0.offset=|v_~#x~0.offset_42|, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_6|, #memory_int=|v_#memory_int_69|, ~#x~0.base=|v_~#x~0.base_42|} OutVars{P1Thread1of1ForFork1_#t~mem30=|v_P1Thread1of1ForFork1_#t~mem30_3|, ~#x~0.offset=|v_~#x~0.offset_42|, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, #memory_int=|v_#memory_int_68|, ~#x~0.base=|v_~#x~0.base_42|, P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~mem30, P1Thread1of1ForFork1_#t~ite31, #memory_int, P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 11:13:00,342 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1084] [1084] L781-->L781-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1787847496 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In1787847496 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1787847496 |P1Thread1of1ForFork1_#t~ite33_Out1787847496|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite33_Out1787847496|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1787847496, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1787847496} OutVars{P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out1787847496|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1787847496, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1787847496} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-07 11:13:00,342 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1081] [1081] L782-->L782-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-547800546 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In-547800546 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-547800546 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-547800546 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out-547800546| ~x$w_buff1_used~0_In-547800546) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-547800546|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-547800546, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-547800546, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-547800546, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-547800546} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-547800546|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-547800546, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-547800546, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-547800546, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-547800546} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 11:13:00,343 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1093] [1093] L783-->L784: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1208642457 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1208642457 256))) (.cse2 (= ~x$r_buff0_thd2~0_Out-1208642457 ~x$r_buff0_thd2~0_In-1208642457))) (or (and (= ~x$r_buff0_thd2~0_Out-1208642457 0) (not .cse0) (not .cse1)) (and .cse1 .cse2) (and .cse0 .cse2))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1208642457, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1208642457} OutVars{P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1208642457|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1208642457, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1208642457} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 11:13:00,343 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1097] [1097] L784-->L784-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In-843353825 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In-843353825 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-843353825 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-843353825 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite36_Out-843353825| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out-843353825| ~x$r_buff1_thd2~0_In-843353825)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-843353825, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-843353825, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-843353825, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-843353825} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-843353825, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-843353825, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-843353825, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-843353825|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-843353825} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 11:13:00,346 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1032] [1032] L803-->L804: Formula: (and (= v_~x$r_buff0_thd3~0_105 v_~x$r_buff0_thd3~0_104) (not (= (mod v_~weak$$choice2~0_77 256) 0))) InVars {~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_105, ~weak$$choice2~0=v_~weak$$choice2~0_77} OutVars{P2Thread1of1ForFork2_#t~ite56=|v_P2Thread1of1ForFork2_#t~ite56_9|, P2Thread1of1ForFork2_#t~ite57=|v_P2Thread1of1ForFork2_#t~ite57_9|, P2Thread1of1ForFork2_#t~ite55=|v_P2Thread1of1ForFork2_#t~ite55_10|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_104, ~weak$$choice2~0=v_~weak$$choice2~0_77} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite56, P2Thread1of1ForFork2_#t~ite57, P2Thread1of1ForFork2_#t~ite55, ~x$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 11:13:00,347 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1083] [1083] L808-->L808-2: Formula: (let ((.cse0 (= (mod ~x$flush_delayed~0_In1069033215 256) 0))) (or (and .cse0 (= (select (select |#memory_int_In1069033215| |~#x~0.base_In1069033215|) |~#x~0.offset_In1069033215|) |P2Thread1of1ForFork2_#t~mem62_Out1069033215|) (= |P2Thread1of1ForFork2_#t~ite63_Out1069033215| |P2Thread1of1ForFork2_#t~mem62_Out1069033215|)) (and (= |P2Thread1of1ForFork2_#t~ite63_Out1069033215| ~x$mem_tmp~0_In1069033215) (not .cse0) (= |P2Thread1of1ForFork2_#t~mem62_In1069033215| |P2Thread1of1ForFork2_#t~mem62_Out1069033215|)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In1069033215, ~#x~0.offset=|~#x~0.offset_In1069033215|, ~#x~0.base=|~#x~0.base_In1069033215|, #memory_int=|#memory_int_In1069033215|, ~x$mem_tmp~0=~x$mem_tmp~0_In1069033215, P2Thread1of1ForFork2_#t~mem62=|P2Thread1of1ForFork2_#t~mem62_In1069033215|} OutVars{~x$flush_delayed~0=~x$flush_delayed~0_In1069033215, ~#x~0.offset=|~#x~0.offset_In1069033215|, P2Thread1of1ForFork2_#t~ite63=|P2Thread1of1ForFork2_#t~ite63_Out1069033215|, ~#x~0.base=|~#x~0.base_In1069033215|, #memory_int=|#memory_int_In1069033215|, ~x$mem_tmp~0=~x$mem_tmp~0_In1069033215, P2Thread1of1ForFork2_#t~mem62=|P2Thread1of1ForFork2_#t~mem62_Out1069033215|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite63, P2Thread1of1ForFork2_#t~mem62] because there is no mapped edge [2019-12-07 11:13:00,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1079] [1079] L815-2-->L815-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In379408405 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In379408405 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite65_Out379408405| ~x$w_buff1~0_In379408405) (not .cse0) (= |P2Thread1of1ForFork2_#t~mem64_In379408405| |P2Thread1of1ForFork2_#t~mem64_Out379408405|) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite65_Out379408405| |P2Thread1of1ForFork2_#t~mem64_Out379408405|) (= |P2Thread1of1ForFork2_#t~mem64_Out379408405| (select (select |#memory_int_In379408405| |~#x~0.base_In379408405|) |~#x~0.offset_In379408405|))))) InVars {~#x~0.offset=|~#x~0.offset_In379408405|, ~x$w_buff1~0=~x$w_buff1~0_In379408405, ~#x~0.base=|~#x~0.base_In379408405|, #memory_int=|#memory_int_In379408405|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In379408405, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In379408405, P2Thread1of1ForFork2_#t~mem64=|P2Thread1of1ForFork2_#t~mem64_In379408405|} OutVars{P2Thread1of1ForFork2_#t~ite65=|P2Thread1of1ForFork2_#t~ite65_Out379408405|, ~#x~0.offset=|~#x~0.offset_In379408405|, ~x$w_buff1~0=~x$w_buff1~0_In379408405, ~#x~0.base=|~#x~0.base_In379408405|, #memory_int=|#memory_int_In379408405|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In379408405, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In379408405, P2Thread1of1ForFork2_#t~mem64=|P2Thread1of1ForFork2_#t~mem64_Out379408405|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite65, P2Thread1of1ForFork2_#t~mem64] because there is no mapped edge [2019-12-07 11:13:00,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1033] [1033] L815-4-->L816: Formula: (= (store |v_#memory_int_131| |v_~#x~0.base_85| (store (select |v_#memory_int_131| |v_~#x~0.base_85|) |v_~#x~0.offset_85| |v_P2Thread1of1ForFork2_#t~ite65_10|)) |v_#memory_int_130|) InVars {P2Thread1of1ForFork2_#t~ite65=|v_P2Thread1of1ForFork2_#t~ite65_10|, ~#x~0.offset=|v_~#x~0.offset_85|, #memory_int=|v_#memory_int_131|, ~#x~0.base=|v_~#x~0.base_85|} OutVars{P2Thread1of1ForFork2_#t~ite65=|v_P2Thread1of1ForFork2_#t~ite65_9|, P2Thread1of1ForFork2_#t~ite66=|v_P2Thread1of1ForFork2_#t~ite66_5|, ~#x~0.offset=|v_~#x~0.offset_85|, #memory_int=|v_#memory_int_130|, ~#x~0.base=|v_~#x~0.base_85|, P2Thread1of1ForFork2_#t~mem64=|v_P2Thread1of1ForFork2_#t~mem64_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite65, P2Thread1of1ForFork2_#t~ite66, #memory_int, P2Thread1of1ForFork2_#t~mem64] because there is no mapped edge [2019-12-07 11:13:00,351 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1086] [1086] L816-->L816-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In1315795223 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1315795223 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite67_Out1315795223| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite67_Out1315795223| ~x$w_buff0_used~0_In1315795223)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1315795223, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1315795223} OutVars{P2Thread1of1ForFork2_#t~ite67=|P2Thread1of1ForFork2_#t~ite67_Out1315795223|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1315795223, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1315795223} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite67] because there is no mapped edge [2019-12-07 11:13:00,351 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1095] [1095] L817-->L817-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-209691881 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-209691881 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-209691881 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd3~0_In-209691881 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-209691881 |P2Thread1of1ForFork2_#t~ite68_Out-209691881|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite68_Out-209691881|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-209691881, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-209691881, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-209691881, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-209691881} OutVars{P2Thread1of1ForFork2_#t~ite68=|P2Thread1of1ForFork2_#t~ite68_Out-209691881|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-209691881, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-209691881, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-209691881, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-209691881} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite68] because there is no mapped edge [2019-12-07 11:13:00,352 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1077] [1077] L818-->L819: Formula: (let ((.cse0 (= ~x$r_buff0_thd3~0_Out-854246549 ~x$r_buff0_thd3~0_In-854246549)) (.cse2 (= (mod ~x$r_buff0_thd3~0_In-854246549 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-854246549 256) 0))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (not .cse2) (= ~x$r_buff0_thd3~0_Out-854246549 0) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-854246549, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-854246549} OutVars{P2Thread1of1ForFork2_#t~ite69=|P2Thread1of1ForFork2_#t~ite69_Out-854246549|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_Out-854246549, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-854246549} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite69, ~x$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 11:13:00,352 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1089] [1089] L819-->L819-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In491888055 256))) (.cse2 (= (mod ~x$r_buff1_thd3~0_In491888055 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In491888055 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In491888055 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite70_Out491888055|)) (and (= ~x$r_buff1_thd3~0_In491888055 |P2Thread1of1ForFork2_#t~ite70_Out491888055|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In491888055, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In491888055, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In491888055, ~x$w_buff0_used~0=~x$w_buff0_used~0_In491888055} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In491888055, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In491888055, P2Thread1of1ForFork2_#t~ite70=|P2Thread1of1ForFork2_#t~ite70_Out491888055|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In491888055, ~x$w_buff0_used~0=~x$w_buff0_used~0_In491888055} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite70] because there is no mapped edge [2019-12-07 11:13:00,352 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1122] [1122] L819-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#t~ite70_34| v_~x$r_buff1_thd3~0_127) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1))) InVars {P2Thread1of1ForFork2_#t~ite70=|v_P2Thread1of1ForFork2_#t~ite70_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68} OutVars{~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_127, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, P2Thread1of1ForFork2_#t~ite70=|v_P2Thread1of1ForFork2_#t~ite70_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, P2Thread1of1ForFork2_#t~ite70, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 11:13:00,355 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1041] [1041] L761-->L762: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_97 256))) (= v_~x$r_buff0_thd1~0_107 v_~x$r_buff0_thd1~0_106)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_107, ~weak$$choice2~0=v_~weak$$choice2~0_97} OutVars{P0Thread1of1ForFork0_#t~ite22=|v_P0Thread1of1ForFork0_#t~ite22_7|, P0Thread1of1ForFork0_#t~ite21=|v_P0Thread1of1ForFork0_#t~ite21_9|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_106, ~weak$$choice2~0=v_~weak$$choice2~0_97, P0Thread1of1ForFork0_#t~ite23=|v_P0Thread1of1ForFork0_#t~ite23_7|} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite22, P0Thread1of1ForFork0_#t~ite21, ~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite23] because there is no mapped edge [2019-12-07 11:13:00,356 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1075] [1075] L764-->L764-2: Formula: (let ((.cse0 (= (mod ~x$flush_delayed~0_In-2113853753 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~mem28_In-2113853753| |P0Thread1of1ForFork0_#t~mem28_Out-2113853753|) (= ~x$mem_tmp~0_In-2113853753 |P0Thread1of1ForFork0_#t~ite29_Out-2113853753|) (not .cse0)) (and (= |P0Thread1of1ForFork0_#t~mem28_Out-2113853753| |P0Thread1of1ForFork0_#t~ite29_Out-2113853753|) (= |P0Thread1of1ForFork0_#t~mem28_Out-2113853753| (select (select |#memory_int_In-2113853753| |~#x~0.base_In-2113853753|) |~#x~0.offset_In-2113853753|)) .cse0))) InVars {P0Thread1of1ForFork0_#t~mem28=|P0Thread1of1ForFork0_#t~mem28_In-2113853753|, ~x$flush_delayed~0=~x$flush_delayed~0_In-2113853753, ~#x~0.offset=|~#x~0.offset_In-2113853753|, ~#x~0.base=|~#x~0.base_In-2113853753|, #memory_int=|#memory_int_In-2113853753|, ~x$mem_tmp~0=~x$mem_tmp~0_In-2113853753} OutVars{P0Thread1of1ForFork0_#t~mem28=|P0Thread1of1ForFork0_#t~mem28_Out-2113853753|, ~x$flush_delayed~0=~x$flush_delayed~0_In-2113853753, ~#x~0.offset=|~#x~0.offset_In-2113853753|, P0Thread1of1ForFork0_#t~ite29=|P0Thread1of1ForFork0_#t~ite29_Out-2113853753|, ~#x~0.base=|~#x~0.base_In-2113853753|, #memory_int=|#memory_int_In-2113853753|, ~x$mem_tmp~0=~x$mem_tmp~0_In-2113853753} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~mem28, P0Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 11:13:00,356 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1117] [1117] L764-2-->P0EXIT: Formula: (and (= |v_#memory_int_248| (store |v_#memory_int_249| |v_~#x~0.base_160| (store (select |v_#memory_int_249| |v_~#x~0.base_160|) |v_~#x~0.offset_160| |v_P0Thread1of1ForFork0_#t~ite29_28|))) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~__unbuffered_cnt~0_49 (+ v_~__unbuffered_cnt~0_50 1)) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~x$flush_delayed~0_92 0)) InVars {~#x~0.offset=|v_~#x~0.offset_160|, P0Thread1of1ForFork0_#t~ite29=|v_P0Thread1of1ForFork0_#t~ite29_28|, #memory_int=|v_#memory_int_249|, ~#x~0.base=|v_~#x~0.base_160|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50} OutVars{P0Thread1of1ForFork0_#t~mem28=|v_P0Thread1of1ForFork0_#t~mem28_17|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, ~x$flush_delayed~0=v_~x$flush_delayed~0_92, ~#x~0.offset=|v_~#x~0.offset_160|, P0Thread1of1ForFork0_#t~ite29=|v_P0Thread1of1ForFork0_#t~ite29_27|, #memory_int=|v_#memory_int_248|, ~#x~0.base=|v_~#x~0.base_160|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~mem28, P0Thread1of1ForFork0_#res.offset, ~x$flush_delayed~0, P0Thread1of1ForFork0_#t~ite29, #memory_int, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 11:13:00,356 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1103] [1103] L784-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~x$r_buff1_thd2~0_28 |v_P1Thread1of1ForFork1_#t~ite36_22|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#t~ite36=|v_P1Thread1of1ForFork1_#t~ite36_22|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_28, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite36=|v_P1Thread1of1ForFork1_#t~ite36_21|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 11:13:00,356 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L846-->L848-2: Formula: (and (or (= (mod v_~x$w_buff0_used~0_118 256) 0) (= (mod v_~x$r_buff0_thd0~0_14 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_118} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 11:13:00,356 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1098] [1098] L848-2-->L848-5: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1697486263 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite76_Out-1697486263| |ULTIMATE.start_main_#t~ite75_Out-1697486263|)) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-1697486263 256) 0))) (or (and (or .cse0 .cse1) .cse2 (= |ULTIMATE.start_main_#t~mem74_Out-1697486263| (select (select |#memory_int_In-1697486263| |~#x~0.base_In-1697486263|) |~#x~0.offset_In-1697486263|)) (= |ULTIMATE.start_main_#t~mem74_Out-1697486263| |ULTIMATE.start_main_#t~ite75_Out-1697486263|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite75_Out-1697486263| ~x$w_buff1~0_In-1697486263) (= |ULTIMATE.start_main_#t~mem74_In-1697486263| |ULTIMATE.start_main_#t~mem74_Out-1697486263|) .cse2 (not .cse0)))) InVars {~#x~0.offset=|~#x~0.offset_In-1697486263|, ULTIMATE.start_main_#t~mem74=|ULTIMATE.start_main_#t~mem74_In-1697486263|, ~x$w_buff1~0=~x$w_buff1~0_In-1697486263, ~#x~0.base=|~#x~0.base_In-1697486263|, #memory_int=|#memory_int_In-1697486263|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1697486263, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1697486263} OutVars{ULTIMATE.start_main_#t~mem74=|ULTIMATE.start_main_#t~mem74_Out-1697486263|, ~#x~0.offset=|~#x~0.offset_In-1697486263|, ~x$w_buff1~0=~x$w_buff1~0_In-1697486263, ~#x~0.base=|~#x~0.base_In-1697486263|, #memory_int=|#memory_int_In-1697486263|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1697486263, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1697486263, ULTIMATE.start_main_#t~ite75=|ULTIMATE.start_main_#t~ite75_Out-1697486263|, ULTIMATE.start_main_#t~ite76=|ULTIMATE.start_main_#t~ite76_Out-1697486263|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem74, ULTIMATE.start_main_#t~ite75, ULTIMATE.start_main_#t~ite76] because there is no mapped edge [2019-12-07 11:13:00,357 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1080] [1080] L849-->L849-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1260253603 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1260253603 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite77_Out-1260253603| ~x$w_buff0_used~0_In-1260253603)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite77_Out-1260253603| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1260253603, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1260253603} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1260253603, ULTIMATE.start_main_#t~ite77=|ULTIMATE.start_main_#t~ite77_Out-1260253603|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1260253603} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite77] because there is no mapped edge [2019-12-07 11:13:00,358 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1082] [1082] L850-->L850-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In1035794751 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd0~0_In1035794751 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1035794751 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1035794751 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite78_Out1035794751|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~x$w_buff1_used~0_In1035794751 |ULTIMATE.start_main_#t~ite78_Out1035794751|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1035794751, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1035794751, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1035794751, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1035794751} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1035794751, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1035794751, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1035794751, ULTIMATE.start_main_#t~ite78=|ULTIMATE.start_main_#t~ite78_Out1035794751|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1035794751} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite78] because there is no mapped edge [2019-12-07 11:13:00,358 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1078] [1078] L851-->L852: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In722180138 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In722180138 256))) (.cse2 (= ~x$r_buff0_thd0~0_In722180138 ~x$r_buff0_thd0~0_Out722180138))) (or (and (not .cse0) (= ~x$r_buff0_thd0~0_Out722180138 0) (not .cse1)) (and .cse0 .cse2) (and .cse1 .cse2))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In722180138, ~x$w_buff0_used~0=~x$w_buff0_used~0_In722180138} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out722180138, ULTIMATE.start_main_#t~ite79=|ULTIMATE.start_main_#t~ite79_Out722180138|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In722180138} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite79] because there is no mapped edge [2019-12-07 11:13:00,358 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1096] [1096] L852-->L856: Formula: (let ((.cse3 (= ~x$r_buff1_thd0~0_Out148404098 ~x$r_buff1_thd0~0_In148404098)) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In148404098 256))) (.cse4 (= 0 (mod ~x$w_buff0_used~0_In148404098 256))) (.cse0 (= |ULTIMATE.start_main_#t~nondet81_In148404098| ~weak$$choice1~0_Out148404098)) (.cse5 (= 0 (mod ~x$r_buff1_thd0~0_In148404098 256))) (.cse6 (= ~x$r_buff1_thd0~0_Out148404098 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In148404098 256) 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse5 .cse3) (and .cse0 .cse5 .cse3 .cse4) (and .cse0 (not .cse1) .cse6 (not .cse4)) (and .cse0 (not .cse5) .cse6 (not .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In148404098, ~x$w_buff1_used~0=~x$w_buff1_used~0_In148404098, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In148404098, ULTIMATE.start_main_#t~nondet81=|ULTIMATE.start_main_#t~nondet81_In148404098|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In148404098} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In148404098, ~weak$$choice1~0=~weak$$choice1~0_Out148404098, ULTIMATE.start_main_#t~ite80=|ULTIMATE.start_main_#t~ite80_Out148404098|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In148404098, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out148404098, ULTIMATE.start_main_#t~nondet81=|ULTIMATE.start_main_#t~nondet81_Out148404098|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In148404098} AuxVars[] AssignedVars[~weak$$choice1~0, ULTIMATE.start_main_#t~ite80, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet81] because there is no mapped edge [2019-12-07 11:13:00,358 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1069] [1069] L856-->L856-3: Formula: (let ((.cse1 (not (= (mod ~__unbuffered_p2_EAX$read_delayed~0_In1360496507 256) 0))) (.cse0 (= 0 (mod ~weak$$choice1~0_In1360496507 256)))) (or (and (= (select (select |#memory_int_In1360496507| ~__unbuffered_p2_EAX$read_delayed_var~0.base_In1360496507) ~__unbuffered_p2_EAX$read_delayed_var~0.offset_In1360496507) |ULTIMATE.start_main_#t~mem82_Out1360496507|) (= |ULTIMATE.start_main_#t~mem82_Out1360496507| |ULTIMATE.start_main_#t~ite83_Out1360496507|) (not .cse0) .cse1) (and (= ~__unbuffered_p2_EAX~0_In1360496507 |ULTIMATE.start_main_#t~ite83_Out1360496507|) (= |ULTIMATE.start_main_#t~mem82_In1360496507| |ULTIMATE.start_main_#t~mem82_Out1360496507|) .cse1 .cse0))) InVars {~weak$$choice1~0=~weak$$choice1~0_In1360496507, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=~__unbuffered_p2_EAX$read_delayed_var~0.offset_In1360496507, ~__unbuffered_p2_EAX$read_delayed_var~0.base=~__unbuffered_p2_EAX$read_delayed_var~0.base_In1360496507, ULTIMATE.start_main_#t~mem82=|ULTIMATE.start_main_#t~mem82_In1360496507|, #memory_int=|#memory_int_In1360496507|, ~__unbuffered_p2_EAX~0=~__unbuffered_p2_EAX~0_In1360496507, ~__unbuffered_p2_EAX$read_delayed~0=~__unbuffered_p2_EAX$read_delayed~0_In1360496507} OutVars{ULTIMATE.start_main_#t~ite83=|ULTIMATE.start_main_#t~ite83_Out1360496507|, ~weak$$choice1~0=~weak$$choice1~0_In1360496507, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=~__unbuffered_p2_EAX$read_delayed_var~0.offset_In1360496507, ULTIMATE.start_main_#t~mem82=|ULTIMATE.start_main_#t~mem82_Out1360496507|, ~__unbuffered_p2_EAX$read_delayed_var~0.base=~__unbuffered_p2_EAX$read_delayed_var~0.base_In1360496507, #memory_int=|#memory_int_In1360496507|, ~__unbuffered_p2_EAX~0=~__unbuffered_p2_EAX~0_In1360496507, ~__unbuffered_p2_EAX$read_delayed~0=~__unbuffered_p2_EAX$read_delayed~0_In1360496507} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite83, ULTIMATE.start_main_#t~mem82] because there is no mapped edge [2019-12-07 11:13:00,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1130] [1130] L856-3-->L5: Formula: (and (= (mod v_~main$tmp_guard1~0_21 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (let ((.cse3 (= v_~__unbuffered_p2_EBX~0_21 0)) (.cse1 (= 1 v_~__unbuffered_p2_EAX~0_46)) (.cse0 (= v_~main$tmp_guard1~0_21 1)) (.cse4 (= 0 v_~__unbuffered_p0_EAX~0_48)) (.cse2 (= |v_ULTIMATE.start_main_#t~ite83_36| v_~__unbuffered_p2_EAX~0_46))) (or (and .cse0 (not .cse1) .cse2) (and .cse0 (not .cse3) .cse2) (and (= v_~main$tmp_guard1~0_21 0) .cse3 .cse1 .cse4 .cse2) (and .cse0 (not .cse4) .cse2)))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_48, ULTIMATE.start_main_#t~ite83=|v_ULTIMATE.start_main_#t~ite83_36|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_21} OutVars{ULTIMATE.start_main_#t~ite84=|v_ULTIMATE.start_main_#t~ite84_33|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_48, ULTIMATE.start_main_#t~ite83=|v_ULTIMATE.start_main_#t~ite83_35|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_21, ULTIMATE.start_main_#t~mem82=|v_ULTIMATE.start_main_#t~mem82_27|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_46, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite84, ULTIMATE.start_main_#t~ite83, ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~mem82, ~main$tmp_guard1~0, ~__unbuffered_p2_EAX~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 11:13:00,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1131] [1131] L5-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-07 11:13:00,421 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_faedc4fc-d82a-4f81-9d9e-1ac3763f9c76/bin/utaipan/witness.graphml [2019-12-07 11:13:00,422 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:13:00,422 INFO L168 Benchmark]: Toolchain (without parser) took 638359.66 ms. Allocated memory was 1.0 GB in the beginning and 5.8 GB in the end (delta: 4.8 GB). Free memory was 938.2 MB in the beginning and 1.3 GB in the end (delta: -408.6 MB). Peak memory consumption was 4.4 GB. Max. memory is 11.5 GB. [2019-12-07 11:13:00,422 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:13:00,423 INFO L168 Benchmark]: CACSL2BoogieTranslator took 397.53 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.3 MB). Free memory was 938.2 MB in the beginning and 1.1 GB in the end (delta: -120.2 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-12-07 11:13:00,423 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.94 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:13:00,423 INFO L168 Benchmark]: Boogie Preprocessor took 30.76 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:13:00,423 INFO L168 Benchmark]: RCFGBuilder took 488.30 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 986.0 MB in the end (delta: 67.0 MB). Peak memory consumption was 67.0 MB. Max. memory is 11.5 GB. [2019-12-07 11:13:00,423 INFO L168 Benchmark]: TraceAbstraction took 637314.06 ms. Allocated memory was 1.1 GB in the beginning and 5.8 GB in the end (delta: 4.7 GB). Free memory was 986.0 MB in the beginning and 1.4 GB in the end (delta: -383.7 MB). Peak memory consumption was 4.3 GB. Max. memory is 11.5 GB. [2019-12-07 11:13:00,424 INFO L168 Benchmark]: Witness Printer took 85.99 ms. Allocated memory is still 5.8 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2019-12-07 11:13:00,425 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 397.53 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.3 MB). Free memory was 938.2 MB in the beginning and 1.1 GB in the end (delta: -120.2 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.94 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.76 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 488.30 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 986.0 MB in the end (delta: 67.0 MB). Peak memory consumption was 67.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 637314.06 ms. Allocated memory was 1.1 GB in the beginning and 5.8 GB in the end (delta: 4.7 GB). Free memory was 986.0 MB in the beginning and 1.4 GB in the end (delta: -383.7 MB). Peak memory consumption was 4.3 GB. Max. memory is 11.5 GB. * Witness Printer took 85.99 ms. Allocated memory is still 5.8 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.3s, 223 ProgramPointsBefore, 117 ProgramPointsAfterwards, 276 TransitionsBefore, 138 TransitionsAfterwards, 32976 CoEnabledTransitionPairs, 8 FixpointIterations, 50 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 62 ConcurrentYvCompositions, 36 ChoiceCompositions, 12209 VarBasedMoverChecksPositive, 278 VarBasedMoverChecksNegative, 32 SemBasedMoverChecksPositive, 347 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.0s, 0 MoverChecksTotal, 183707 CheckedPairsTotal, 146 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L838] FCALL, FORK 0 pthread_create(&t2464, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L840] FCALL, FORK 0 pthread_create(&t2465, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L842] FCALL, FORK 0 pthread_create(&t2466, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L794] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L795] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L796] 3 x$flush_delayed = weak$$choice2 [L797] EXPR 3 \read(x) [L797] 3 x$mem_tmp = x [L777] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice1=0, weak$$choice2=1, x={5:0}, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L780] 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice1=0, weak$$choice2=1, x={5:0}, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L798] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L798] EXPR 3 \read(x) [L798] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1)=1, \read(x)=1, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice1=0, weak$$choice2=1, x={5:0}, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L798] 3 x = !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L781] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L782] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L799] EXPR 3 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice1=0, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0))=0, x={5:0}, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L799] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L800] EXPR 3 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice1=0, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1))=0, x={5:0}, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L800] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L801] EXPR 3 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice1=0, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used))=0, x={5:0}, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L801] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L802] EXPR 3 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice1=0, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x={5:0}, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L802] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] EXPR 3 weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice1=0, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x={5:0}, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L804] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L805] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L806] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L807] EXPR 3 \read(x) [L807] 3 __unbuffered_p2_EAX = x [L808] 3 x = x$flush_delayed ? x$mem_tmp : x [L809] 3 x$flush_delayed = (_Bool)0 [L812] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={5:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice1=0, weak$$choice2=1, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L747] 1 y = 1 [L752] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L753] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L754] 1 x$flush_delayed = weak$$choice2 [L755] EXPR 1 \read(x) [L755] 1 x$mem_tmp = x [L756] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L756] EXPR 1 \read(x) [L756] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, \read(x)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={5:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=0, weak$$choice2=1, x={5:0}, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L756] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L757] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={5:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=0, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=0, x={5:0}, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L815] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={5:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=0, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=0, x={5:0}, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L757] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L816] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L817] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L758] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={5:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=0, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x={5:0}, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L758] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L759] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={5:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=0, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=0, x={5:0}, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L759] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L760] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={5:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=0, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x={5:0}, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L760] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={5:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=0, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x={5:0}, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L762] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] EXPR 1 \read(x) [L763] 1 __unbuffered_p0_EAX = x [L844] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={5:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice1=0, weak$$choice2=1, x={5:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L848] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L849] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L850] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 214 locations, 1 error locations. Result: UNSAFE, OverallTime: 637.1s, OverallIterations: 119, TraceHistogramMax: 1, AutomataDifference: 403.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 35328 SDtfs, 65208 SDslu, 418639 SDs, 0 SdLazy, 315638 SolverSat, 6969 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 232.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5361 GetRequests, 311 SyntacticMatches, 177 SemanticMatches, 4873 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56497 ImplicationChecksByTransitivity, 147.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=300418occurred 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: 80.4s AutomataMinimizationTime, 118 MinimizatonAttempts, 699766 StatesRemovedByMinimization, 114 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 54.2s InterpolantComputationTime, 8323 NumberOfCodeBlocks, 8323 NumberOfCodeBlocksAsserted, 119 NumberOfCheckSat, 8133 ConstructedInterpolants, 0 QuantifiedInterpolants, 10510063 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 118 InterpolantComputations, 118 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...