./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix033_power.oepc.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_5babf723-e4d1-4621-9de4-70e5e2e1ba68/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_5babf723-e4d1-4621-9de4-70e5e2e1ba68/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_5babf723-e4d1-4621-9de4-70e5e2e1ba68/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_5babf723-e4d1-4621-9de4-70e5e2e1ba68/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix033_power.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_5babf723-e4d1-4621-9de4-70e5e2e1ba68/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_5babf723-e4d1-4621-9de4-70e5e2e1ba68/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 26c00609450d0c6b51da4247483bad4298e13733 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 21:47:14,500 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 21:47:14,501 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 21:47:14,508 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 21:47:14,508 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 21:47:14,509 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 21:47:14,510 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 21:47:14,511 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 21:47:14,513 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 21:47:14,513 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 21:47:14,514 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 21:47:14,515 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 21:47:14,515 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 21:47:14,516 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 21:47:14,516 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 21:47:14,517 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 21:47:14,518 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 21:47:14,518 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 21:47:14,520 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 21:47:14,521 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 21:47:14,522 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 21:47:14,523 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 21:47:14,523 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 21:47:14,524 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 21:47:14,526 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 21:47:14,526 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 21:47:14,526 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 21:47:14,526 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 21:47:14,527 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 21:47:14,527 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 21:47:14,527 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 21:47:14,528 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 21:47:14,528 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 21:47:14,529 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 21:47:14,529 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 21:47:14,529 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 21:47:14,530 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 21:47:14,530 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 21:47:14,530 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 21:47:14,531 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 21:47:14,531 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 21:47:14,531 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_5babf723-e4d1-4621-9de4-70e5e2e1ba68/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 21:47:14,541 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 21:47:14,541 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 21:47:14,541 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 21:47:14,542 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 21:47:14,542 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 21:47:14,542 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 21:47:14,542 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 21:47:14,542 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 21:47:14,542 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 21:47:14,542 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 21:47:14,542 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 21:47:14,542 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 21:47:14,543 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 21:47:14,543 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 21:47:14,543 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 21:47:14,543 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 21:47:14,543 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 21:47:14,544 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 21:47:14,544 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 21:47:14,544 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 21:47:14,544 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 21:47:14,544 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 21:47:14,544 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 21:47:14,544 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 21:47:14,544 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 21:47:14,544 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 21:47:14,545 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 21:47:14,545 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 21:47:14,545 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 21:47:14,545 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 21:47:14,545 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 21:47:14,545 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 21:47:14,545 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 21:47:14,546 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 21:47:14,546 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 21:47:14,546 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 21:47:14,546 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 21:47:14,546 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 21:47:14,546 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 21:47:14,546 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 21:47:14,547 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_5babf723-e4d1-4621-9de4-70e5e2e1ba68/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 -> 26c00609450d0c6b51da4247483bad4298e13733 [2019-12-07 21:47:14,645 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 21:47:14,655 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 21:47:14,657 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 21:47:14,659 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 21:47:14,659 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 21:47:14,660 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_5babf723-e4d1-4621-9de4-70e5e2e1ba68/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix033_power.oepc.i [2019-12-07 21:47:14,705 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5babf723-e4d1-4621-9de4-70e5e2e1ba68/bin/utaipan/data/559f5d027/6cd592abade94c4599cdd92bb4da4fd0/FLAG738b2a34a [2019-12-07 21:47:15,190 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 21:47:15,190 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_5babf723-e4d1-4621-9de4-70e5e2e1ba68/sv-benchmarks/c/pthread-wmm/mix033_power.oepc.i [2019-12-07 21:47:15,200 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_5babf723-e4d1-4621-9de4-70e5e2e1ba68/bin/utaipan/data/559f5d027/6cd592abade94c4599cdd92bb4da4fd0/FLAG738b2a34a [2019-12-07 21:47:15,209 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_5babf723-e4d1-4621-9de4-70e5e2e1ba68/bin/utaipan/data/559f5d027/6cd592abade94c4599cdd92bb4da4fd0 [2019-12-07 21:47:15,211 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 21:47:15,212 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 21:47:15,213 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 21:47:15,213 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 21:47:15,215 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 21:47:15,216 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:47:15" (1/1) ... [2019-12-07 21:47:15,217 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f8fae9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:47:15, skipping insertion in model container [2019-12-07 21:47:15,217 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:47:15" (1/1) ... [2019-12-07 21:47:15,222 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 21:47:15,251 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 21:47:15,496 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:47:15,504 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 21:47:15,548 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:47:15,594 INFO L208 MainTranslator]: Completed translation [2019-12-07 21:47:15,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:47:15 WrapperNode [2019-12-07 21:47:15,595 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 21:47:15,595 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 21:47:15,595 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 21:47:15,595 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 21:47:15,601 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:47:15" (1/1) ... [2019-12-07 21:47:15,614 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:47:15" (1/1) ... [2019-12-07 21:47:15,633 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 21:47:15,634 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 21:47:15,634 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 21:47:15,634 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 21:47:15,641 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:47:15" (1/1) ... [2019-12-07 21:47:15,641 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:47:15" (1/1) ... [2019-12-07 21:47:15,644 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:47:15" (1/1) ... [2019-12-07 21:47:15,645 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:47:15" (1/1) ... [2019-12-07 21:47:15,652 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:47:15" (1/1) ... [2019-12-07 21:47:15,655 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:47:15" (1/1) ... [2019-12-07 21:47:15,657 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:47:15" (1/1) ... [2019-12-07 21:47:15,661 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 21:47:15,661 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 21:47:15,661 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 21:47:15,661 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 21:47:15,662 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:47:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_5babf723-e4d1-4621-9de4-70e5e2e1ba68/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 21:47:15,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 21:47:15,711 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 21:47:15,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 21:47:15,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 21:47:15,711 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 21:47:15,711 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 21:47:15,711 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 21:47:15,712 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 21:47:15,712 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 21:47:15,712 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 21:47:15,712 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 21:47:15,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 21:47:15,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 21:47:15,714 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 21:47:16,077 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 21:47:16,077 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 21:47:16,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:47:16 BoogieIcfgContainer [2019-12-07 21:47:16,079 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 21:47:16,080 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 21:47:16,080 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 21:47:16,082 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 21:47:16,082 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 09:47:15" (1/3) ... [2019-12-07 21:47:16,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@586c934c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:47:16, skipping insertion in model container [2019-12-07 21:47:16,083 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:47:15" (2/3) ... [2019-12-07 21:47:16,083 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@586c934c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:47:16, skipping insertion in model container [2019-12-07 21:47:16,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:47:16" (3/3) ... [2019-12-07 21:47:16,085 INFO L109 eAbstractionObserver]: Analyzing ICFG mix033_power.oepc.i [2019-12-07 21:47:16,093 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 21:47:16,094 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 21:47:16,099 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 21:47:16,100 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 21:47:16,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,126 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,126 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,126 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,126 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,127 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,132 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,132 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,138 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,138 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,139 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,139 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,140 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,141 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,142 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,143 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,144 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,145 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:47:16,170 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 21:47:16,182 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 21:47:16,182 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 21:47:16,182 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 21:47:16,182 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 21:47:16,182 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 21:47:16,183 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 21:47:16,183 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 21:47:16,183 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 21:47:16,193 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 216 transitions [2019-12-07 21:47:16,194 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-07 21:47:16,248 INFO L134 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-07 21:47:16,248 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 21:47:16,258 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 694 event pairs. 9/173 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 21:47:16,275 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 216 transitions [2019-12-07 21:47:16,308 INFO L134 PetriNetUnfolder]: 47/213 cut-off events. [2019-12-07 21:47:16,308 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 21:47:16,313 INFO L76 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 213 events. 47/213 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 694 event pairs. 9/173 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 21:47:16,329 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-07 21:47:16,330 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 21:47:19,349 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-07 21:47:19,602 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-12-07 21:47:19,624 INFO L206 etLargeBlockEncoding]: Checked pairs total: 80691 [2019-12-07 21:47:19,624 INFO L214 etLargeBlockEncoding]: Total number of compositions: 120 [2019-12-07 21:47:19,626 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 102 transitions [2019-12-07 21:47:32,425 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 109594 states. [2019-12-07 21:47:32,427 INFO L276 IsEmpty]: Start isEmpty. Operand 109594 states. [2019-12-07 21:47:32,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 21:47:32,431 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:47:32,431 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 21:47:32,431 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:47:32,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:47:32,435 INFO L82 PathProgramCache]: Analyzing trace with hash 925663, now seen corresponding path program 1 times [2019-12-07 21:47:32,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:47:32,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666284029] [2019-12-07 21:47:32,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:47:32,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:47:32,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 21:47:32,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666284029] [2019-12-07 21:47:32,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:47:32,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 21:47:32,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745832767] [2019-12-07 21:47:32,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:47:32,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:47:32,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:47:32,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:47:32,593 INFO L87 Difference]: Start difference. First operand 109594 states. Second operand 3 states. [2019-12-07 21:47:33,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:47:33,302 INFO L93 Difference]: Finished difference Result 108584 states and 463030 transitions. [2019-12-07 21:47:33,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:47:33,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 21:47:33,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:47:33,929 INFO L225 Difference]: With dead ends: 108584 [2019-12-07 21:47:33,929 INFO L226 Difference]: Without dead ends: 102344 [2019-12-07 21:47:33,930 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:47:37,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102344 states. [2019-12-07 21:47:38,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102344 to 102344. [2019-12-07 21:47:38,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102344 states. [2019-12-07 21:47:39,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102344 states to 102344 states and 435834 transitions. [2019-12-07 21:47:39,315 INFO L78 Accepts]: Start accepts. Automaton has 102344 states and 435834 transitions. Word has length 3 [2019-12-07 21:47:39,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:47:39,316 INFO L462 AbstractCegarLoop]: Abstraction has 102344 states and 435834 transitions. [2019-12-07 21:47:39,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:47:39,316 INFO L276 IsEmpty]: Start isEmpty. Operand 102344 states and 435834 transitions. [2019-12-07 21:47:39,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 21:47:39,319 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:47:39,319 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:47:39,319 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:47:39,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:47:39,319 INFO L82 PathProgramCache]: Analyzing trace with hash 295188242, now seen corresponding path program 1 times [2019-12-07 21:47:39,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:47:39,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943163522] [2019-12-07 21:47:39,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:47:39,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:47:39,384 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 21:47:39,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943163522] [2019-12-07 21:47:39,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:47:39,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:47:39,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322754678] [2019-12-07 21:47:39,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:47:39,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:47:39,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:47:39,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:47:39,386 INFO L87 Difference]: Start difference. First operand 102344 states and 435834 transitions. Second operand 4 states. [2019-12-07 21:47:41,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:47:41,978 INFO L93 Difference]: Finished difference Result 162816 states and 664963 transitions. [2019-12-07 21:47:41,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:47:41,978 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 21:47:41,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:47:42,389 INFO L225 Difference]: With dead ends: 162816 [2019-12-07 21:47:42,389 INFO L226 Difference]: Without dead ends: 162767 [2019-12-07 21:47:42,390 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 21:47:47,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162767 states. [2019-12-07 21:47:49,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162767 to 148375. [2019-12-07 21:47:49,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148375 states. [2019-12-07 21:47:49,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148375 states to 148375 states and 613985 transitions. [2019-12-07 21:47:49,506 INFO L78 Accepts]: Start accepts. Automaton has 148375 states and 613985 transitions. Word has length 11 [2019-12-07 21:47:49,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:47:49,507 INFO L462 AbstractCegarLoop]: Abstraction has 148375 states and 613985 transitions. [2019-12-07 21:47:49,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:47:49,507 INFO L276 IsEmpty]: Start isEmpty. Operand 148375 states and 613985 transitions. [2019-12-07 21:47:49,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 21:47:49,514 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:47:49,514 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:47:49,514 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:47:49,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:47:49,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1979345710, now seen corresponding path program 1 times [2019-12-07 21:47:49,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:47:49,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646858974] [2019-12-07 21:47:49,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:47:49,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:47:49,579 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 21:47:49,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646858974] [2019-12-07 21:47:49,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:47:49,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:47:49,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104661060] [2019-12-07 21:47:49,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:47:49,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:47:49,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:47:49,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:47:49,580 INFO L87 Difference]: Start difference. First operand 148375 states and 613985 transitions. Second operand 4 states. [2019-12-07 21:47:51,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:47:51,093 INFO L93 Difference]: Finished difference Result 208037 states and 841937 transitions. [2019-12-07 21:47:51,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:47:51,094 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 21:47:51,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:47:51,612 INFO L225 Difference]: With dead ends: 208037 [2019-12-07 21:47:51,612 INFO L226 Difference]: Without dead ends: 207981 [2019-12-07 21:47:51,613 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 21:47:58,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207981 states. [2019-12-07 21:48:01,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207981 to 175449. [2019-12-07 21:48:01,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175449 states. [2019-12-07 21:48:02,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175449 states to 175449 states and 722246 transitions. [2019-12-07 21:48:02,039 INFO L78 Accepts]: Start accepts. Automaton has 175449 states and 722246 transitions. Word has length 13 [2019-12-07 21:48:02,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:48:02,040 INFO L462 AbstractCegarLoop]: Abstraction has 175449 states and 722246 transitions. [2019-12-07 21:48:02,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:48:02,040 INFO L276 IsEmpty]: Start isEmpty. Operand 175449 states and 722246 transitions. [2019-12-07 21:48:02,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 21:48:02,047 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:48:02,047 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:48:02,048 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:48:02,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:48:02,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1850281775, now seen corresponding path program 1 times [2019-12-07 21:48:02,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:48:02,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569778729] [2019-12-07 21:48:02,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:48:02,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:48:02,077 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 21:48:02,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569778729] [2019-12-07 21:48:02,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:48:02,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:48:02,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896073627] [2019-12-07 21:48:02,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:48:02,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:48:02,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:48:02,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:48:02,078 INFO L87 Difference]: Start difference. First operand 175449 states and 722246 transitions. Second operand 3 states. [2019-12-07 21:48:03,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:48:03,315 INFO L93 Difference]: Finished difference Result 259190 states and 1053818 transitions. [2019-12-07 21:48:03,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:48:03,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 21:48:03,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:48:03,966 INFO L225 Difference]: With dead ends: 259190 [2019-12-07 21:48:03,966 INFO L226 Difference]: Without dead ends: 259190 [2019-12-07 21:48:03,966 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 21:48:10,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259190 states. [2019-12-07 21:48:15,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259190 to 195219. [2019-12-07 21:48:15,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195219 states. [2019-12-07 21:48:16,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195219 states to 195219 states and 799392 transitions. [2019-12-07 21:48:16,118 INFO L78 Accepts]: Start accepts. Automaton has 195219 states and 799392 transitions. Word has length 16 [2019-12-07 21:48:16,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:48:16,118 INFO L462 AbstractCegarLoop]: Abstraction has 195219 states and 799392 transitions. [2019-12-07 21:48:16,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:48:16,118 INFO L276 IsEmpty]: Start isEmpty. Operand 195219 states and 799392 transitions. [2019-12-07 21:48:16,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 21:48:16,125 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:48:16,125 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:48:16,125 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:48:16,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:48:16,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1985443542, now seen corresponding path program 1 times [2019-12-07 21:48:16,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:48:16,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828760492] [2019-12-07 21:48:16,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:48:16,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:48:16,163 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 21:48:16,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828760492] [2019-12-07 21:48:16,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:48:16,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:48:16,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890186857] [2019-12-07 21:48:16,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:48:16,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:48:16,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:48:16,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:48:16,164 INFO L87 Difference]: Start difference. First operand 195219 states and 799392 transitions. Second operand 4 states. [2019-12-07 21:48:17,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:48:17,663 INFO L93 Difference]: Finished difference Result 227593 states and 924546 transitions. [2019-12-07 21:48:17,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:48:17,664 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 21:48:17,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:48:18,254 INFO L225 Difference]: With dead ends: 227593 [2019-12-07 21:48:18,254 INFO L226 Difference]: Without dead ends: 227593 [2019-12-07 21:48:18,254 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 21:48:23,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227593 states. [2019-12-07 21:48:29,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227593 to 204638. [2019-12-07 21:48:29,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204638 states. [2019-12-07 21:48:30,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204638 states to 204638 states and 837381 transitions. [2019-12-07 21:48:30,005 INFO L78 Accepts]: Start accepts. Automaton has 204638 states and 837381 transitions. Word has length 16 [2019-12-07 21:48:30,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:48:30,005 INFO L462 AbstractCegarLoop]: Abstraction has 204638 states and 837381 transitions. [2019-12-07 21:48:30,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:48:30,005 INFO L276 IsEmpty]: Start isEmpty. Operand 204638 states and 837381 transitions. [2019-12-07 21:48:30,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 21:48:30,012 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:48:30,013 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:48:30,013 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:48:30,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:48:30,013 INFO L82 PathProgramCache]: Analyzing trace with hash -32753983, now seen corresponding path program 1 times [2019-12-07 21:48:30,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:48:30,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301713883] [2019-12-07 21:48:30,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:48:30,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:48:30,058 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 21:48:30,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301713883] [2019-12-07 21:48:30,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:48:30,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:48:30,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774698649] [2019-12-07 21:48:30,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:48:30,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:48:30,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:48:30,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:48:30,060 INFO L87 Difference]: Start difference. First operand 204638 states and 837381 transitions. Second operand 4 states. [2019-12-07 21:48:31,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:48:31,676 INFO L93 Difference]: Finished difference Result 239634 states and 974592 transitions. [2019-12-07 21:48:31,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:48:31,676 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 21:48:31,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:48:32,315 INFO L225 Difference]: With dead ends: 239634 [2019-12-07 21:48:32,315 INFO L226 Difference]: Without dead ends: 239634 [2019-12-07 21:48:32,315 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 21:48:38,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239634 states. [2019-12-07 21:48:41,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239634 to 207981. [2019-12-07 21:48:41,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207981 states. [2019-12-07 21:48:42,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207981 states to 207981 states and 851409 transitions. [2019-12-07 21:48:42,390 INFO L78 Accepts]: Start accepts. Automaton has 207981 states and 851409 transitions. Word has length 16 [2019-12-07 21:48:42,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:48:42,390 INFO L462 AbstractCegarLoop]: Abstraction has 207981 states and 851409 transitions. [2019-12-07 21:48:42,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:48:42,390 INFO L276 IsEmpty]: Start isEmpty. Operand 207981 states and 851409 transitions. [2019-12-07 21:48:42,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 21:48:42,403 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:48:42,403 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:48:42,404 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:48:42,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:48:42,404 INFO L82 PathProgramCache]: Analyzing trace with hash -486126770, now seen corresponding path program 1 times [2019-12-07 21:48:42,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:48:42,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469992777] [2019-12-07 21:48:42,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:48:42,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:48:42,455 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 21:48:42,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469992777] [2019-12-07 21:48:42,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:48:42,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 21:48:42,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002421400] [2019-12-07 21:48:42,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:48:42,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:48:42,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:48:42,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:48:42,456 INFO L87 Difference]: Start difference. First operand 207981 states and 851409 transitions. Second operand 3 states. [2019-12-07 21:48:46,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:48:46,723 INFO L93 Difference]: Finished difference Result 372280 states and 1515056 transitions. [2019-12-07 21:48:46,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:48:46,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 21:48:46,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:48:47,571 INFO L225 Difference]: With dead ends: 372280 [2019-12-07 21:48:47,571 INFO L226 Difference]: Without dead ends: 337486 [2019-12-07 21:48:47,571 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:48:54,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337486 states. [2019-12-07 21:48:59,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337486 to 324440. [2019-12-07 21:48:59,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324440 states. [2019-12-07 21:49:00,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324440 states to 324440 states and 1329299 transitions. [2019-12-07 21:49:00,271 INFO L78 Accepts]: Start accepts. Automaton has 324440 states and 1329299 transitions. Word has length 18 [2019-12-07 21:49:00,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:49:00,271 INFO L462 AbstractCegarLoop]: Abstraction has 324440 states and 1329299 transitions. [2019-12-07 21:49:00,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:49:00,272 INFO L276 IsEmpty]: Start isEmpty. Operand 324440 states and 1329299 transitions. [2019-12-07 21:49:00,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 21:49:00,292 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:49:00,292 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:49:00,293 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:49:00,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:49:00,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1539660278, now seen corresponding path program 1 times [2019-12-07 21:49:00,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:49:00,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681771776] [2019-12-07 21:49:00,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:49:00,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:49:00,329 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 21:49:00,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681771776] [2019-12-07 21:49:00,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:49:00,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:49:00,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347446503] [2019-12-07 21:49:00,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 21:49:00,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:49:00,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 21:49:00,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:49:00,330 INFO L87 Difference]: Start difference. First operand 324440 states and 1329299 transitions. Second operand 5 states. [2019-12-07 21:49:03,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:49:03,218 INFO L93 Difference]: Finished difference Result 458907 states and 1837584 transitions. [2019-12-07 21:49:03,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 21:49:03,218 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-07 21:49:03,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:49:05,138 INFO L225 Difference]: With dead ends: 458907 [2019-12-07 21:49:05,138 INFO L226 Difference]: Without dead ends: 458816 [2019-12-07 21:49:05,139 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 21:49:17,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458816 states. [2019-12-07 21:49:23,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458816 to 349791. [2019-12-07 21:49:23,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349791 states. [2019-12-07 21:49:24,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349791 states to 349791 states and 1426231 transitions. [2019-12-07 21:49:24,657 INFO L78 Accepts]: Start accepts. Automaton has 349791 states and 1426231 transitions. Word has length 19 [2019-12-07 21:49:24,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:49:24,657 INFO L462 AbstractCegarLoop]: Abstraction has 349791 states and 1426231 transitions. [2019-12-07 21:49:24,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 21:49:24,658 INFO L276 IsEmpty]: Start isEmpty. Operand 349791 states and 1426231 transitions. [2019-12-07 21:49:24,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 21:49:24,684 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:49:24,684 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:49:24,684 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:49:24,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:49:24,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1882855134, now seen corresponding path program 1 times [2019-12-07 21:49:24,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:49:24,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868583236] [2019-12-07 21:49:24,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:49:24,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:49:24,719 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 21:49:24,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868583236] [2019-12-07 21:49:24,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:49:24,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 21:49:24,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401002328] [2019-12-07 21:49:24,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:49:24,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:49:24,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:49:24,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:49:24,721 INFO L87 Difference]: Start difference. First operand 349791 states and 1426231 transitions. Second operand 3 states. [2019-12-07 21:49:26,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:49:26,853 INFO L93 Difference]: Finished difference Result 349467 states and 1424966 transitions. [2019-12-07 21:49:26,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:49:26,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 21:49:26,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:49:27,795 INFO L225 Difference]: With dead ends: 349467 [2019-12-07 21:49:27,795 INFO L226 Difference]: Without dead ends: 349467 [2019-12-07 21:49:27,796 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:49:38,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349467 states. [2019-12-07 21:49:43,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349467 to 346461. [2019-12-07 21:49:43,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346461 states. [2019-12-07 21:49:44,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346461 states to 346461 states and 1413505 transitions. [2019-12-07 21:49:44,884 INFO L78 Accepts]: Start accepts. Automaton has 346461 states and 1413505 transitions. Word has length 19 [2019-12-07 21:49:44,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:49:44,884 INFO L462 AbstractCegarLoop]: Abstraction has 346461 states and 1413505 transitions. [2019-12-07 21:49:44,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:49:44,884 INFO L276 IsEmpty]: Start isEmpty. Operand 346461 states and 1413505 transitions. [2019-12-07 21:49:44,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 21:49:44,911 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:49:44,911 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:49:44,911 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:49:44,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:49:44,912 INFO L82 PathProgramCache]: Analyzing trace with hash -434257907, now seen corresponding path program 1 times [2019-12-07 21:49:44,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:49:44,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064612230] [2019-12-07 21:49:44,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:49:44,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:49:44,962 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 21:49:44,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064612230] [2019-12-07 21:49:44,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:49:44,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:49:44,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182849198] [2019-12-07 21:49:44,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:49:44,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:49:44,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:49:44,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:49:44,964 INFO L87 Difference]: Start difference. First operand 346461 states and 1413505 transitions. Second operand 4 states. [2019-12-07 21:49:46,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:49:46,590 INFO L93 Difference]: Finished difference Result 359648 states and 1454980 transitions. [2019-12-07 21:49:46,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:49:46,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 21:49:46,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:49:48,190 INFO L225 Difference]: With dead ends: 359648 [2019-12-07 21:49:48,191 INFO L226 Difference]: Without dead ends: 359648 [2019-12-07 21:49:48,191 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:49:55,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359648 states. [2019-12-07 21:50:00,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359648 to 335030. [2019-12-07 21:50:00,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335030 states. [2019-12-07 21:50:02,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335030 states to 335030 states and 1366497 transitions. [2019-12-07 21:50:02,323 INFO L78 Accepts]: Start accepts. Automaton has 335030 states and 1366497 transitions. Word has length 19 [2019-12-07 21:50:02,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:50:02,323 INFO L462 AbstractCegarLoop]: Abstraction has 335030 states and 1366497 transitions. [2019-12-07 21:50:02,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:50:02,323 INFO L276 IsEmpty]: Start isEmpty. Operand 335030 states and 1366497 transitions. [2019-12-07 21:50:02,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 21:50:02,354 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:50:02,354 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] [2019-12-07 21:50:02,354 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:50:02,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:50:02,355 INFO L82 PathProgramCache]: Analyzing trace with hash -10262915, now seen corresponding path program 1 times [2019-12-07 21:50:02,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:50:02,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608891976] [2019-12-07 21:50:02,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:50:02,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:50:02,391 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 21:50:02,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608891976] [2019-12-07 21:50:02,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:50:02,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:50:02,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122837077] [2019-12-07 21:50:02,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:50:02,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:50:02,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:50:02,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:50:02,392 INFO L87 Difference]: Start difference. First operand 335030 states and 1366497 transitions. Second operand 4 states. [2019-12-07 21:50:02,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:50:02,734 INFO L93 Difference]: Finished difference Result 92668 states and 313200 transitions. [2019-12-07 21:50:02,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:50:02,734 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-12-07 21:50:02,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:50:02,859 INFO L225 Difference]: With dead ends: 92668 [2019-12-07 21:50:02,859 INFO L226 Difference]: Without dead ends: 70315 [2019-12-07 21:50:02,860 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 21:50:03,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70315 states. [2019-12-07 21:50:03,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70315 to 70047. [2019-12-07 21:50:03,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70047 states. [2019-12-07 21:50:04,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70047 states to 70047 states and 224423 transitions. [2019-12-07 21:50:04,002 INFO L78 Accepts]: Start accepts. Automaton has 70047 states and 224423 transitions. Word has length 20 [2019-12-07 21:50:04,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:50:04,002 INFO L462 AbstractCegarLoop]: Abstraction has 70047 states and 224423 transitions. [2019-12-07 21:50:04,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:50:04,002 INFO L276 IsEmpty]: Start isEmpty. Operand 70047 states and 224423 transitions. [2019-12-07 21:50:04,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 21:50:04,009 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:50:04,009 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] [2019-12-07 21:50:04,009 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:50:04,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:50:04,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1141389468, now seen corresponding path program 1 times [2019-12-07 21:50:04,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:50:04,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018211589] [2019-12-07 21:50:04,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:50:04,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:50:04,041 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 21:50:04,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018211589] [2019-12-07 21:50:04,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:50:04,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:50:04,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441638223] [2019-12-07 21:50:04,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 21:50:04,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:50:04,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 21:50:04,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:50:04,042 INFO L87 Difference]: Start difference. First operand 70047 states and 224423 transitions. Second operand 5 states. [2019-12-07 21:50:04,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:50:04,547 INFO L93 Difference]: Finished difference Result 87873 states and 276129 transitions. [2019-12-07 21:50:04,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 21:50:04,547 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 21:50:04,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:50:05,993 INFO L225 Difference]: With dead ends: 87873 [2019-12-07 21:50:05,993 INFO L226 Difference]: Without dead ends: 87817 [2019-12-07 21:50:05,993 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 21:50:06,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87817 states. [2019-12-07 21:50:07,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87817 to 73245. [2019-12-07 21:50:07,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73245 states. [2019-12-07 21:50:07,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73245 states to 73245 states and 233961 transitions. [2019-12-07 21:50:07,218 INFO L78 Accepts]: Start accepts. Automaton has 73245 states and 233961 transitions. Word has length 22 [2019-12-07 21:50:07,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:50:07,218 INFO L462 AbstractCegarLoop]: Abstraction has 73245 states and 233961 transitions. [2019-12-07 21:50:07,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 21:50:07,218 INFO L276 IsEmpty]: Start isEmpty. Operand 73245 states and 233961 transitions. [2019-12-07 21:50:07,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 21:50:07,224 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:50:07,225 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] [2019-12-07 21:50:07,225 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:50:07,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:50:07,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1541375313, now seen corresponding path program 1 times [2019-12-07 21:50:07,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:50:07,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618297697] [2019-12-07 21:50:07,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:50:07,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:50:07,275 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 21:50:07,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618297697] [2019-12-07 21:50:07,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:50:07,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:50:07,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210496753] [2019-12-07 21:50:07,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 21:50:07,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:50:07,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 21:50:07,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:50:07,276 INFO L87 Difference]: Start difference. First operand 73245 states and 233961 transitions. Second operand 5 states. [2019-12-07 21:50:07,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:50:07,834 INFO L93 Difference]: Finished difference Result 92191 states and 289455 transitions. [2019-12-07 21:50:07,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 21:50:07,835 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 21:50:07,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:50:07,969 INFO L225 Difference]: With dead ends: 92191 [2019-12-07 21:50:07,969 INFO L226 Difference]: Without dead ends: 92135 [2019-12-07 21:50:07,970 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 21:50:08,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92135 states. [2019-12-07 21:50:09,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92135 to 73106. [2019-12-07 21:50:09,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73106 states. [2019-12-07 21:50:09,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73106 states to 73106 states and 233328 transitions. [2019-12-07 21:50:09,393 INFO L78 Accepts]: Start accepts. Automaton has 73106 states and 233328 transitions. Word has length 22 [2019-12-07 21:50:09,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:50:09,394 INFO L462 AbstractCegarLoop]: Abstraction has 73106 states and 233328 transitions. [2019-12-07 21:50:09,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 21:50:09,394 INFO L276 IsEmpty]: Start isEmpty. Operand 73106 states and 233328 transitions. [2019-12-07 21:50:09,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 21:50:09,409 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:50:09,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] [2019-12-07 21:50:09,410 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:50:09,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:50:09,410 INFO L82 PathProgramCache]: Analyzing trace with hash 2020314615, now seen corresponding path program 1 times [2019-12-07 21:50:09,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:50:09,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231510812] [2019-12-07 21:50:09,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:50:09,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:50:09,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 21:50:09,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231510812] [2019-12-07 21:50:09,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:50:09,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:50:09,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973480997] [2019-12-07 21:50:09,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 21:50:09,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:50:09,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 21:50:09,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:50:09,448 INFO L87 Difference]: Start difference. First operand 73106 states and 233328 transitions. Second operand 5 states. [2019-12-07 21:50:09,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:50:09,842 INFO L93 Difference]: Finished difference Result 85745 states and 270007 transitions. [2019-12-07 21:50:09,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 21:50:09,843 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 21:50:09,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:50:09,962 INFO L225 Difference]: With dead ends: 85745 [2019-12-07 21:50:09,962 INFO L226 Difference]: Without dead ends: 85577 [2019-12-07 21:50:09,962 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:50:10,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85577 states. [2019-12-07 21:50:11,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85577 to 78044. [2019-12-07 21:50:11,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78044 states. [2019-12-07 21:50:11,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78044 states to 78044 states and 248122 transitions. [2019-12-07 21:50:11,412 INFO L78 Accepts]: Start accepts. Automaton has 78044 states and 248122 transitions. Word has length 26 [2019-12-07 21:50:11,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:50:11,412 INFO L462 AbstractCegarLoop]: Abstraction has 78044 states and 248122 transitions. [2019-12-07 21:50:11,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 21:50:11,412 INFO L276 IsEmpty]: Start isEmpty. Operand 78044 states and 248122 transitions. [2019-12-07 21:50:11,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 21:50:11,428 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:50:11,428 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] [2019-12-07 21:50:11,428 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:50:11,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:50:11,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1824549582, now seen corresponding path program 1 times [2019-12-07 21:50:11,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:50:11,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407744392] [2019-12-07 21:50:11,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:50:11,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:50:11,453 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 21:50:11,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407744392] [2019-12-07 21:50:11,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:50:11,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:50:11,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027484838] [2019-12-07 21:50:11,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:50:11,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:50:11,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:50:11,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:50:11,455 INFO L87 Difference]: Start difference. First operand 78044 states and 248122 transitions. Second operand 3 states. [2019-12-07 21:50:11,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:50:11,725 INFO L93 Difference]: Finished difference Result 93689 states and 290353 transitions. [2019-12-07 21:50:11,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:50:11,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-07 21:50:11,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:50:11,860 INFO L225 Difference]: With dead ends: 93689 [2019-12-07 21:50:11,860 INFO L226 Difference]: Without dead ends: 93689 [2019-12-07 21:50:11,861 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 21:50:12,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93689 states. [2019-12-07 21:50:13,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93689 to 78044. [2019-12-07 21:50:13,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78044 states. [2019-12-07 21:50:13,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78044 states to 78044 states and 242490 transitions. [2019-12-07 21:50:13,343 INFO L78 Accepts]: Start accepts. Automaton has 78044 states and 242490 transitions. Word has length 26 [2019-12-07 21:50:13,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:50:13,344 INFO L462 AbstractCegarLoop]: Abstraction has 78044 states and 242490 transitions. [2019-12-07 21:50:13,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:50:13,344 INFO L276 IsEmpty]: Start isEmpty. Operand 78044 states and 242490 transitions. [2019-12-07 21:50:13,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 21:50:13,364 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:50:13,364 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 21:50:13,364 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:50:13,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:50:13,364 INFO L82 PathProgramCache]: Analyzing trace with hash -77744514, now seen corresponding path program 1 times [2019-12-07 21:50:13,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:50:13,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772779464] [2019-12-07 21:50:13,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:50:13,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:50:13,400 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 21:50:13,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772779464] [2019-12-07 21:50:13,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:50:13,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:50:13,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068233343] [2019-12-07 21:50:13,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 21:50:13,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:50:13,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 21:50:13,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:50:13,402 INFO L87 Difference]: Start difference. First operand 78044 states and 242490 transitions. Second operand 5 states. [2019-12-07 21:50:13,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:50:13,840 INFO L93 Difference]: Finished difference Result 90491 states and 278295 transitions. [2019-12-07 21:50:13,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 21:50:13,841 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-07 21:50:13,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:50:13,970 INFO L225 Difference]: With dead ends: 90491 [2019-12-07 21:50:13,970 INFO L226 Difference]: Without dead ends: 90307 [2019-12-07 21:50:13,970 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:50:14,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90307 states. [2019-12-07 21:50:15,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90307 to 78157. [2019-12-07 21:50:15,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78157 states. [2019-12-07 21:50:15,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78157 states to 78157 states and 242662 transitions. [2019-12-07 21:50:15,375 INFO L78 Accepts]: Start accepts. Automaton has 78157 states and 242662 transitions. Word has length 28 [2019-12-07 21:50:15,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:50:15,375 INFO L462 AbstractCegarLoop]: Abstraction has 78157 states and 242662 transitions. [2019-12-07 21:50:15,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 21:50:15,375 INFO L276 IsEmpty]: Start isEmpty. Operand 78157 states and 242662 transitions. [2019-12-07 21:50:15,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 21:50:15,562 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:50:15,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] [2019-12-07 21:50:15,562 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:50:15,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:50:15,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1882800045, now seen corresponding path program 1 times [2019-12-07 21:50:15,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:50:15,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402760998] [2019-12-07 21:50:15,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:50:15,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:50:15,609 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 21:50:15,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402760998] [2019-12-07 21:50:15,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:50:15,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 21:50:15,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126386919] [2019-12-07 21:50:15,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 21:50:15,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:50:15,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 21:50:15,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:50:15,611 INFO L87 Difference]: Start difference. First operand 78157 states and 242662 transitions. Second operand 5 states. [2019-12-07 21:50:16,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:50:16,283 INFO L93 Difference]: Finished difference Result 108616 states and 334711 transitions. [2019-12-07 21:50:16,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 21:50:16,284 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-07 21:50:16,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:50:16,451 INFO L225 Difference]: With dead ends: 108616 [2019-12-07 21:50:16,451 INFO L226 Difference]: Without dead ends: 108616 [2019-12-07 21:50:16,451 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:50:16,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108616 states. [2019-12-07 21:50:17,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108616 to 95404. [2019-12-07 21:50:17,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95404 states. [2019-12-07 21:50:18,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95404 states to 95404 states and 296245 transitions. [2019-12-07 21:50:18,162 INFO L78 Accepts]: Start accepts. Automaton has 95404 states and 296245 transitions. Word has length 30 [2019-12-07 21:50:18,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:50:18,162 INFO L462 AbstractCegarLoop]: Abstraction has 95404 states and 296245 transitions. [2019-12-07 21:50:18,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 21:50:18,162 INFO L276 IsEmpty]: Start isEmpty. Operand 95404 states and 296245 transitions. [2019-12-07 21:50:18,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 21:50:18,400 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:50:18,400 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] [2019-12-07 21:50:18,400 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:50:18,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:50:18,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1127086001, now seen corresponding path program 1 times [2019-12-07 21:50:18,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:50:18,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709902657] [2019-12-07 21:50:18,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:50:18,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:50:18,445 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 21:50:18,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709902657] [2019-12-07 21:50:18,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:50:18,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 21:50:18,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892452270] [2019-12-07 21:50:18,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 21:50:18,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:50:18,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 21:50:18,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:50:18,446 INFO L87 Difference]: Start difference. First operand 95404 states and 296245 transitions. Second operand 5 states. [2019-12-07 21:50:19,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:50:19,180 INFO L93 Difference]: Finished difference Result 129727 states and 398782 transitions. [2019-12-07 21:50:19,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 21:50:19,181 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-07 21:50:19,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:50:19,380 INFO L225 Difference]: With dead ends: 129727 [2019-12-07 21:50:19,380 INFO L226 Difference]: Without dead ends: 129720 [2019-12-07 21:50:19,380 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:50:19,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129720 states. [2019-12-07 21:50:21,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129720 to 104515. [2019-12-07 21:50:21,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104515 states. [2019-12-07 21:50:21,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104515 states to 104515 states and 325156 transitions. [2019-12-07 21:50:21,583 INFO L78 Accepts]: Start accepts. Automaton has 104515 states and 325156 transitions. Word has length 30 [2019-12-07 21:50:21,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:50:21,583 INFO L462 AbstractCegarLoop]: Abstraction has 104515 states and 325156 transitions. [2019-12-07 21:50:21,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 21:50:21,583 INFO L276 IsEmpty]: Start isEmpty. Operand 104515 states and 325156 transitions. [2019-12-07 21:50:21,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 21:50:21,626 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:50:21,627 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] [2019-12-07 21:50:21,627 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:50:21,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:50:21,627 INFO L82 PathProgramCache]: Analyzing trace with hash -604665634, now seen corresponding path program 1 times [2019-12-07 21:50:21,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:50:21,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394909558] [2019-12-07 21:50:21,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:50:21,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:50:21,674 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 21:50:21,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394909558] [2019-12-07 21:50:21,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:50:21,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 21:50:21,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889989862] [2019-12-07 21:50:21,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 21:50:21,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:50:21,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 21:50:21,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:50:21,675 INFO L87 Difference]: Start difference. First operand 104515 states and 325156 transitions. Second operand 5 states. [2019-12-07 21:50:21,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:50:21,849 INFO L93 Difference]: Finished difference Result 53285 states and 157282 transitions. [2019-12-07 21:50:21,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:50:21,849 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-07 21:50:21,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:50:21,903 INFO L225 Difference]: With dead ends: 53285 [2019-12-07 21:50:21,903 INFO L226 Difference]: Without dead ends: 46313 [2019-12-07 21:50:21,903 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 21:50:22,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46313 states. [2019-12-07 21:50:22,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46313 to 42602. [2019-12-07 21:50:22,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42602 states. [2019-12-07 21:50:22,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42602 states to 42602 states and 125703 transitions. [2019-12-07 21:50:22,500 INFO L78 Accepts]: Start accepts. Automaton has 42602 states and 125703 transitions. Word has length 31 [2019-12-07 21:50:22,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:50:22,500 INFO L462 AbstractCegarLoop]: Abstraction has 42602 states and 125703 transitions. [2019-12-07 21:50:22,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 21:50:22,500 INFO L276 IsEmpty]: Start isEmpty. Operand 42602 states and 125703 transitions. [2019-12-07 21:50:22,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 21:50:22,532 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:50:22,532 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] [2019-12-07 21:50:22,532 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:50:22,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:50:22,532 INFO L82 PathProgramCache]: Analyzing trace with hash 147507175, now seen corresponding path program 1 times [2019-12-07 21:50:22,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:50:22,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695777658] [2019-12-07 21:50:22,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:50:22,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:50:22,562 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 21:50:22,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695777658] [2019-12-07 21:50:22,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:50:22,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:50:22,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060688992] [2019-12-07 21:50:22,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 21:50:22,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:50:22,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 21:50:22,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:50:22,563 INFO L87 Difference]: Start difference. First operand 42602 states and 125703 transitions. Second operand 5 states. [2019-12-07 21:50:22,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:50:22,863 INFO L93 Difference]: Finished difference Result 46906 states and 137331 transitions. [2019-12-07 21:50:22,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 21:50:22,863 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-12-07 21:50:22,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:50:22,916 INFO L225 Difference]: With dead ends: 46906 [2019-12-07 21:50:22,916 INFO L226 Difference]: Without dead ends: 46728 [2019-12-07 21:50:22,916 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:50:23,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46728 states. [2019-12-07 21:50:23,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46728 to 42945. [2019-12-07 21:50:23,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42945 states. [2019-12-07 21:50:23,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42945 states to 42945 states and 126670 transitions. [2019-12-07 21:50:23,575 INFO L78 Accepts]: Start accepts. Automaton has 42945 states and 126670 transitions. Word has length 32 [2019-12-07 21:50:23,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:50:23,575 INFO L462 AbstractCegarLoop]: Abstraction has 42945 states and 126670 transitions. [2019-12-07 21:50:23,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 21:50:23,575 INFO L276 IsEmpty]: Start isEmpty. Operand 42945 states and 126670 transitions. [2019-12-07 21:50:23,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 21:50:23,604 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:50:23,605 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] [2019-12-07 21:50:23,605 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:50:23,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:50:23,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1407969559, now seen corresponding path program 2 times [2019-12-07 21:50:23,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:50:23,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696476550] [2019-12-07 21:50:23,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:50:23,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:50:23,644 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 21:50:23,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696476550] [2019-12-07 21:50:23,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:50:23,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 21:50:23,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549380288] [2019-12-07 21:50:23,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 21:50:23,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:50:23,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 21:50:23,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:50:23,645 INFO L87 Difference]: Start difference. First operand 42945 states and 126670 transitions. Second operand 6 states. [2019-12-07 21:50:24,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:50:24,177 INFO L93 Difference]: Finished difference Result 51283 states and 149631 transitions. [2019-12-07 21:50:24,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 21:50:24,178 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-07 21:50:24,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:50:24,237 INFO L225 Difference]: With dead ends: 51283 [2019-12-07 21:50:24,237 INFO L226 Difference]: Without dead ends: 50986 [2019-12-07 21:50:24,237 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-07 21:50:24,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50986 states. [2019-12-07 21:50:24,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50986 to 43945. [2019-12-07 21:50:24,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43945 states. [2019-12-07 21:50:24,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43945 states to 43945 states and 129661 transitions. [2019-12-07 21:50:24,904 INFO L78 Accepts]: Start accepts. Automaton has 43945 states and 129661 transitions. Word has length 32 [2019-12-07 21:50:24,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:50:24,904 INFO L462 AbstractCegarLoop]: Abstraction has 43945 states and 129661 transitions. [2019-12-07 21:50:24,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 21:50:24,904 INFO L276 IsEmpty]: Start isEmpty. Operand 43945 states and 129661 transitions. [2019-12-07 21:50:24,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 21:50:24,938 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:50:24,939 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] [2019-12-07 21:50:24,939 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:50:24,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:50:24,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1247784206, now seen corresponding path program 1 times [2019-12-07 21:50:24,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:50:24,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157791616] [2019-12-07 21:50:24,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:50:24,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:50:24,977 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 21:50:24,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157791616] [2019-12-07 21:50:24,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:50:24,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 21:50:24,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048108192] [2019-12-07 21:50:24,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 21:50:24,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:50:24,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 21:50:24,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:50:24,979 INFO L87 Difference]: Start difference. First operand 43945 states and 129661 transitions. Second operand 6 states. [2019-12-07 21:50:25,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:50:25,463 INFO L93 Difference]: Finished difference Result 51906 states and 151336 transitions. [2019-12-07 21:50:25,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 21:50:25,463 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-07 21:50:25,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:50:25,527 INFO L225 Difference]: With dead ends: 51906 [2019-12-07 21:50:25,527 INFO L226 Difference]: Without dead ends: 51531 [2019-12-07 21:50:25,527 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-07 21:50:25,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51531 states. [2019-12-07 21:50:26,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51531 to 42739. [2019-12-07 21:50:26,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42739 states. [2019-12-07 21:50:26,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42739 states to 42739 states and 126112 transitions. [2019-12-07 21:50:26,205 INFO L78 Accepts]: Start accepts. Automaton has 42739 states and 126112 transitions. Word has length 34 [2019-12-07 21:50:26,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:50:26,205 INFO L462 AbstractCegarLoop]: Abstraction has 42739 states and 126112 transitions. [2019-12-07 21:50:26,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 21:50:26,205 INFO L276 IsEmpty]: Start isEmpty. Operand 42739 states and 126112 transitions. [2019-12-07 21:50:26,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 21:50:26,242 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:50:26,242 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] [2019-12-07 21:50:26,242 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:50:26,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:50:26,242 INFO L82 PathProgramCache]: Analyzing trace with hash 433291681, now seen corresponding path program 1 times [2019-12-07 21:50:26,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:50:26,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88719699] [2019-12-07 21:50:26,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:50:26,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:50:26,299 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 21:50:26,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88719699] [2019-12-07 21:50:26,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:50:26,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 21:50:26,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695767435] [2019-12-07 21:50:26,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 21:50:26,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:50:26,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 21:50:26,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:50:26,300 INFO L87 Difference]: Start difference. First operand 42739 states and 126112 transitions. Second operand 6 states. [2019-12-07 21:50:27,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:50:27,119 INFO L93 Difference]: Finished difference Result 56931 states and 165247 transitions. [2019-12-07 21:50:27,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 21:50:27,119 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-07 21:50:27,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:50:27,186 INFO L225 Difference]: With dead ends: 56931 [2019-12-07 21:50:27,186 INFO L226 Difference]: Without dead ends: 56931 [2019-12-07 21:50:27,187 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-07 21:50:27,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56931 states. [2019-12-07 21:50:27,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56931 to 43869. [2019-12-07 21:50:27,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43869 states. [2019-12-07 21:50:27,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43869 states to 43869 states and 129384 transitions. [2019-12-07 21:50:27,947 INFO L78 Accepts]: Start accepts. Automaton has 43869 states and 129384 transitions. Word has length 40 [2019-12-07 21:50:27,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:50:27,947 INFO L462 AbstractCegarLoop]: Abstraction has 43869 states and 129384 transitions. [2019-12-07 21:50:27,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 21:50:27,947 INFO L276 IsEmpty]: Start isEmpty. Operand 43869 states and 129384 transitions. [2019-12-07 21:50:27,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 21:50:27,986 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:50:27,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] [2019-12-07 21:50:27,986 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:50:27,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:50:27,986 INFO L82 PathProgramCache]: Analyzing trace with hash 157594801, now seen corresponding path program 2 times [2019-12-07 21:50:27,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:50:27,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391850672] [2019-12-07 21:50:27,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:50:27,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:50:28,045 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 21:50:28,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391850672] [2019-12-07 21:50:28,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:50:28,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 21:50:28,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809198260] [2019-12-07 21:50:28,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 21:50:28,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:50:28,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 21:50:28,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:50:28,047 INFO L87 Difference]: Start difference. First operand 43869 states and 129384 transitions. Second operand 7 states. [2019-12-07 21:50:28,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:50:28,884 INFO L93 Difference]: Finished difference Result 68649 states and 201096 transitions. [2019-12-07 21:50:28,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 21:50:28,885 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-07 21:50:28,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:50:28,972 INFO L225 Difference]: With dead ends: 68649 [2019-12-07 21:50:28,973 INFO L226 Difference]: Without dead ends: 68649 [2019-12-07 21:50:28,973 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-07 21:50:29,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68649 states. [2019-12-07 21:50:29,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68649 to 43990. [2019-12-07 21:50:29,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43990 states. [2019-12-07 21:50:29,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43990 states to 43990 states and 129732 transitions. [2019-12-07 21:50:29,780 INFO L78 Accepts]: Start accepts. Automaton has 43990 states and 129732 transitions. Word has length 40 [2019-12-07 21:50:29,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:50:29,780 INFO L462 AbstractCegarLoop]: Abstraction has 43990 states and 129732 transitions. [2019-12-07 21:50:29,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 21:50:29,780 INFO L276 IsEmpty]: Start isEmpty. Operand 43990 states and 129732 transitions. [2019-12-07 21:50:29,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 21:50:29,818 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:50:29,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] [2019-12-07 21:50:29,819 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:50:29,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:50:29,819 INFO L82 PathProgramCache]: Analyzing trace with hash -782678122, now seen corresponding path program 1 times [2019-12-07 21:50:29,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:50:29,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920423458] [2019-12-07 21:50:29,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:50:29,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:50:29,876 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 21:50:29,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920423458] [2019-12-07 21:50:29,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:50:29,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:50:29,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421594027] [2019-12-07 21:50:29,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:50:29,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:50:29,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:50:29,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:50:29,877 INFO L87 Difference]: Start difference. First operand 43990 states and 129732 transitions. Second operand 4 states. [2019-12-07 21:50:30,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:50:30,034 INFO L93 Difference]: Finished difference Result 62747 states and 185560 transitions. [2019-12-07 21:50:30,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:50:30,035 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-12-07 21:50:30,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:50:30,059 INFO L225 Difference]: With dead ends: 62747 [2019-12-07 21:50:30,059 INFO L226 Difference]: Without dead ends: 23879 [2019-12-07 21:50:30,060 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:50:30,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23879 states. [2019-12-07 21:50:30,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23879 to 23721. [2019-12-07 21:50:30,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23721 states. [2019-12-07 21:50:30,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23721 states to 23721 states and 69032 transitions. [2019-12-07 21:50:30,388 INFO L78 Accepts]: Start accepts. Automaton has 23721 states and 69032 transitions. Word has length 41 [2019-12-07 21:50:30,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:50:30,388 INFO L462 AbstractCegarLoop]: Abstraction has 23721 states and 69032 transitions. [2019-12-07 21:50:30,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:50:30,388 INFO L276 IsEmpty]: Start isEmpty. Operand 23721 states and 69032 transitions. [2019-12-07 21:50:30,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 21:50:30,407 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:50:30,407 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] [2019-12-07 21:50:30,407 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:50:30,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:50:30,407 INFO L82 PathProgramCache]: Analyzing trace with hash -2063356405, now seen corresponding path program 1 times [2019-12-07 21:50:30,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:50:30,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441446028] [2019-12-07 21:50:30,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:50:30,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:50:30,549 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 21:50:30,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441446028] [2019-12-07 21:50:30,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:50:30,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 21:50:30,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501431451] [2019-12-07 21:50:30,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 21:50:30,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:50:30,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 21:50:30,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:50:30,550 INFO L87 Difference]: Start difference. First operand 23721 states and 69032 transitions. Second operand 6 states. [2019-12-07 21:50:30,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:50:30,637 INFO L93 Difference]: Finished difference Result 22638 states and 66573 transitions. [2019-12-07 21:50:30,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 21:50:30,637 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-07 21:50:30,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:50:30,658 INFO L225 Difference]: With dead ends: 22638 [2019-12-07 21:50:30,658 INFO L226 Difference]: Without dead ends: 20409 [2019-12-07 21:50:30,658 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 21:50:30,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20409 states. [2019-12-07 21:50:30,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20409 to 19310. [2019-12-07 21:50:30,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19310 states. [2019-12-07 21:50:30,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19310 states to 19310 states and 58460 transitions. [2019-12-07 21:50:30,946 INFO L78 Accepts]: Start accepts. Automaton has 19310 states and 58460 transitions. Word has length 41 [2019-12-07 21:50:30,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:50:30,946 INFO L462 AbstractCegarLoop]: Abstraction has 19310 states and 58460 transitions. [2019-12-07 21:50:30,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 21:50:30,947 INFO L276 IsEmpty]: Start isEmpty. Operand 19310 states and 58460 transitions. [2019-12-07 21:50:30,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 21:50:30,963 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:50:30,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] [2019-12-07 21:50:30,963 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:50:30,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:50:30,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1854566034, now seen corresponding path program 1 times [2019-12-07 21:50:30,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:50:30,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194331245] [2019-12-07 21:50:30,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:50:30,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:50:31,011 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 21:50:31,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194331245] [2019-12-07 21:50:31,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:50:31,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 21:50:31,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448526241] [2019-12-07 21:50:31,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 21:50:31,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:50:31,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 21:50:31,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:50:31,012 INFO L87 Difference]: Start difference. First operand 19310 states and 58460 transitions. Second operand 6 states. [2019-12-07 21:50:31,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:50:31,513 INFO L93 Difference]: Finished difference Result 27071 states and 80519 transitions. [2019-12-07 21:50:31,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 21:50:31,514 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2019-12-07 21:50:31,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:50:31,543 INFO L225 Difference]: With dead ends: 27071 [2019-12-07 21:50:31,544 INFO L226 Difference]: Without dead ends: 27071 [2019-12-07 21:50:31,544 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-07 21:50:31,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27071 states. [2019-12-07 21:50:31,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27071 to 21118. [2019-12-07 21:50:31,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21118 states. [2019-12-07 21:50:31,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21118 states to 21118 states and 63693 transitions. [2019-12-07 21:50:31,884 INFO L78 Accepts]: Start accepts. Automaton has 21118 states and 63693 transitions. Word has length 63 [2019-12-07 21:50:31,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:50:31,884 INFO L462 AbstractCegarLoop]: Abstraction has 21118 states and 63693 transitions. [2019-12-07 21:50:31,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 21:50:31,884 INFO L276 IsEmpty]: Start isEmpty. Operand 21118 states and 63693 transitions. [2019-12-07 21:50:31,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 21:50:31,902 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:50:31,903 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] [2019-12-07 21:50:31,903 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:50:31,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:50:31,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1519513004, now seen corresponding path program 2 times [2019-12-07 21:50:31,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:50:31,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848134359] [2019-12-07 21:50:31,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:50:31,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:50:31,933 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 21:50:31,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848134359] [2019-12-07 21:50:31,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:50:31,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:50:31,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880879939] [2019-12-07 21:50:31,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:50:31,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:50:31,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:50:31,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:50:31,934 INFO L87 Difference]: Start difference. First operand 21118 states and 63693 transitions. Second operand 3 states. [2019-12-07 21:50:32,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:50:32,025 INFO L93 Difference]: Finished difference Result 26290 states and 79286 transitions. [2019-12-07 21:50:32,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:50:32,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-12-07 21:50:32,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:50:32,056 INFO L225 Difference]: With dead ends: 26290 [2019-12-07 21:50:32,056 INFO L226 Difference]: Without dead ends: 26290 [2019-12-07 21:50:32,056 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 21:50:32,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26290 states. [2019-12-07 21:50:32,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26290 to 20660. [2019-12-07 21:50:32,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20660 states. [2019-12-07 21:50:32,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20660 states to 20660 states and 62788 transitions. [2019-12-07 21:50:32,386 INFO L78 Accepts]: Start accepts. Automaton has 20660 states and 62788 transitions. Word has length 63 [2019-12-07 21:50:32,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:50:32,387 INFO L462 AbstractCegarLoop]: Abstraction has 20660 states and 62788 transitions. [2019-12-07 21:50:32,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:50:32,387 INFO L276 IsEmpty]: Start isEmpty. Operand 20660 states and 62788 transitions. [2019-12-07 21:50:32,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-07 21:50:32,405 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:50:32,406 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] [2019-12-07 21:50:32,406 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:50:32,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:50:32,406 INFO L82 PathProgramCache]: Analyzing trace with hash 805773276, now seen corresponding path program 1 times [2019-12-07 21:50:32,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:50:32,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330225002] [2019-12-07 21:50:32,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:50:32,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:50:32,437 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 21:50:32,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330225002] [2019-12-07 21:50:32,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:50:32,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:50:32,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228519313] [2019-12-07 21:50:32,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:50:32,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:50:32,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:50:32,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:50:32,438 INFO L87 Difference]: Start difference. First operand 20660 states and 62788 transitions. Second operand 3 states. [2019-12-07 21:50:32,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:50:32,490 INFO L93 Difference]: Finished difference Result 20659 states and 62786 transitions. [2019-12-07 21:50:32,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:50:32,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-07 21:50:32,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:50:32,512 INFO L225 Difference]: With dead ends: 20659 [2019-12-07 21:50:32,512 INFO L226 Difference]: Without dead ends: 20659 [2019-12-07 21:50:32,513 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 21:50:32,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20659 states. [2019-12-07 21:50:32,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20659 to 14909. [2019-12-07 21:50:32,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14909 states. [2019-12-07 21:50:32,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14909 states to 14909 states and 46224 transitions. [2019-12-07 21:50:32,771 INFO L78 Accepts]: Start accepts. Automaton has 14909 states and 46224 transitions. Word has length 64 [2019-12-07 21:50:32,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:50:32,771 INFO L462 AbstractCegarLoop]: Abstraction has 14909 states and 46224 transitions. [2019-12-07 21:50:32,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:50:32,771 INFO L276 IsEmpty]: Start isEmpty. Operand 14909 states and 46224 transitions. [2019-12-07 21:50:32,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 21:50:32,785 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:50:32,785 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] [2019-12-07 21:50:32,785 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:50:32,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:50:32,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1553923546, now seen corresponding path program 1 times [2019-12-07 21:50:32,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:50:32,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695790666] [2019-12-07 21:50:32,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:50:32,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:50:32,869 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 21:50:32,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695790666] [2019-12-07 21:50:32,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:50:32,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 21:50:32,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343026506] [2019-12-07 21:50:32,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 21:50:32,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:50:32,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 21:50:32,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:50:32,871 INFO L87 Difference]: Start difference. First operand 14909 states and 46224 transitions. Second operand 7 states. [2019-12-07 21:50:33,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:50:33,198 INFO L93 Difference]: Finished difference Result 45467 states and 139233 transitions. [2019-12-07 21:50:33,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 21:50:33,198 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-07 21:50:33,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:50:33,235 INFO L225 Difference]: With dead ends: 45467 [2019-12-07 21:50:33,236 INFO L226 Difference]: Without dead ends: 33470 [2019-12-07 21:50:33,236 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-07 21:50:33,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33470 states. [2019-12-07 21:50:33,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33470 to 17908. [2019-12-07 21:50:33,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17908 states. [2019-12-07 21:50:33,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17908 states to 17908 states and 55130 transitions. [2019-12-07 21:50:33,616 INFO L78 Accepts]: Start accepts. Automaton has 17908 states and 55130 transitions. Word has length 65 [2019-12-07 21:50:33,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:50:33,616 INFO L462 AbstractCegarLoop]: Abstraction has 17908 states and 55130 transitions. [2019-12-07 21:50:33,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 21:50:33,616 INFO L276 IsEmpty]: Start isEmpty. Operand 17908 states and 55130 transitions. [2019-12-07 21:50:33,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 21:50:33,631 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:50:33,631 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] [2019-12-07 21:50:33,631 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:50:33,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:50:33,632 INFO L82 PathProgramCache]: Analyzing trace with hash -490914692, now seen corresponding path program 2 times [2019-12-07 21:50:33,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:50:33,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664527791] [2019-12-07 21:50:33,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:50:33,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:50:33,708 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 21:50:33,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664527791] [2019-12-07 21:50:33,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:50:33,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 21:50:33,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934078389] [2019-12-07 21:50:33,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 21:50:33,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:50:33,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 21:50:33,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:50:33,709 INFO L87 Difference]: Start difference. First operand 17908 states and 55130 transitions. Second operand 7 states. [2019-12-07 21:50:34,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:50:34,162 INFO L93 Difference]: Finished difference Result 50689 states and 153359 transitions. [2019-12-07 21:50:34,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 21:50:34,162 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-07 21:50:34,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:50:34,208 INFO L225 Difference]: With dead ends: 50689 [2019-12-07 21:50:34,208 INFO L226 Difference]: Without dead ends: 37354 [2019-12-07 21:50:34,209 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-12-07 21:50:34,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37354 states. [2019-12-07 21:50:34,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37354 to 20757. [2019-12-07 21:50:34,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20757 states. [2019-12-07 21:50:34,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20757 states to 20757 states and 63331 transitions. [2019-12-07 21:50:34,644 INFO L78 Accepts]: Start accepts. Automaton has 20757 states and 63331 transitions. Word has length 65 [2019-12-07 21:50:34,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:50:34,644 INFO L462 AbstractCegarLoop]: Abstraction has 20757 states and 63331 transitions. [2019-12-07 21:50:34,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 21:50:34,644 INFO L276 IsEmpty]: Start isEmpty. Operand 20757 states and 63331 transitions. [2019-12-07 21:50:34,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 21:50:34,663 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:50:34,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] [2019-12-07 21:50:34,663 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:50:34,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:50:34,664 INFO L82 PathProgramCache]: Analyzing trace with hash 2127876196, now seen corresponding path program 3 times [2019-12-07 21:50:34,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:50:34,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4024967] [2019-12-07 21:50:34,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:50:34,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:50:34,730 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 21:50:34,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4024967] [2019-12-07 21:50:34,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:50:34,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 21:50:34,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526404263] [2019-12-07 21:50:34,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 21:50:34,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:50:34,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 21:50:34,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:50:34,732 INFO L87 Difference]: Start difference. First operand 20757 states and 63331 transitions. Second operand 7 states. [2019-12-07 21:50:35,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:50:35,056 INFO L93 Difference]: Finished difference Result 41057 states and 123955 transitions. [2019-12-07 21:50:35,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 21:50:35,056 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-07 21:50:35,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:50:35,101 INFO L225 Difference]: With dead ends: 41057 [2019-12-07 21:50:35,102 INFO L226 Difference]: Without dead ends: 38685 [2019-12-07 21:50:35,102 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-12-07 21:50:35,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38685 states. [2019-12-07 21:50:35,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38685 to 20878. [2019-12-07 21:50:35,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20878 states. [2019-12-07 21:50:35,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20878 states to 20878 states and 63750 transitions. [2019-12-07 21:50:35,534 INFO L78 Accepts]: Start accepts. Automaton has 20878 states and 63750 transitions. Word has length 65 [2019-12-07 21:50:35,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:50:35,534 INFO L462 AbstractCegarLoop]: Abstraction has 20878 states and 63750 transitions. [2019-12-07 21:50:35,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 21:50:35,534 INFO L276 IsEmpty]: Start isEmpty. Operand 20878 states and 63750 transitions. [2019-12-07 21:50:35,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 21:50:35,552 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:50:35,553 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] [2019-12-07 21:50:35,553 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:50:35,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:50:35,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1853946760, now seen corresponding path program 4 times [2019-12-07 21:50:35,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:50:35,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878913392] [2019-12-07 21:50:35,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:50:35,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:50:35,608 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 21:50:35,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878913392] [2019-12-07 21:50:35,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:50:35,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:50:35,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573851008] [2019-12-07 21:50:35,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:50:35,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:50:35,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:50:35,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:50:35,609 INFO L87 Difference]: Start difference. First operand 20878 states and 63750 transitions. Second operand 4 states. [2019-12-07 21:50:35,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:50:35,719 INFO L93 Difference]: Finished difference Result 36901 states and 112893 transitions. [2019-12-07 21:50:35,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:50:35,719 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-07 21:50:35,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:50:35,762 INFO L225 Difference]: With dead ends: 36901 [2019-12-07 21:50:35,762 INFO L226 Difference]: Without dead ends: 32671 [2019-12-07 21:50:35,762 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 21:50:35,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32671 states. [2019-12-07 21:50:36,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32671 to 20206. [2019-12-07 21:50:36,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20206 states. [2019-12-07 21:50:36,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20206 states to 20206 states and 61635 transitions. [2019-12-07 21:50:36,142 INFO L78 Accepts]: Start accepts. Automaton has 20206 states and 61635 transitions. Word has length 65 [2019-12-07 21:50:36,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:50:36,142 INFO L462 AbstractCegarLoop]: Abstraction has 20206 states and 61635 transitions. [2019-12-07 21:50:36,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:50:36,142 INFO L276 IsEmpty]: Start isEmpty. Operand 20206 states and 61635 transitions. [2019-12-07 21:50:36,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 21:50:36,161 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:50:36,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] [2019-12-07 21:50:36,161 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:50:36,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:50:36,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1130939332, now seen corresponding path program 5 times [2019-12-07 21:50:36,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:50:36,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608555549] [2019-12-07 21:50:36,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:50:36,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:50:36,210 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 21:50:36,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608555549] [2019-12-07 21:50:36,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:50:36,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:50:36,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802765201] [2019-12-07 21:50:36,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:50:36,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:50:36,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:50:36,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:50:36,212 INFO L87 Difference]: Start difference. First operand 20206 states and 61635 transitions. Second operand 3 states. [2019-12-07 21:50:36,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:50:36,253 INFO L93 Difference]: Finished difference Result 15472 states and 46497 transitions. [2019-12-07 21:50:36,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:50:36,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-07 21:50:36,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:50:36,271 INFO L225 Difference]: With dead ends: 15472 [2019-12-07 21:50:36,271 INFO L226 Difference]: Without dead ends: 15472 [2019-12-07 21:50:36,271 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 21:50:36,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15472 states. [2019-12-07 21:50:36,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15472 to 13877. [2019-12-07 21:50:36,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13877 states. [2019-12-07 21:50:36,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13877 states to 13877 states and 41802 transitions. [2019-12-07 21:50:36,486 INFO L78 Accepts]: Start accepts. Automaton has 13877 states and 41802 transitions. Word has length 65 [2019-12-07 21:50:36,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:50:36,486 INFO L462 AbstractCegarLoop]: Abstraction has 13877 states and 41802 transitions. [2019-12-07 21:50:36,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:50:36,486 INFO L276 IsEmpty]: Start isEmpty. Operand 13877 states and 41802 transitions. [2019-12-07 21:50:36,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 21:50:36,499 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:50:36,499 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] [2019-12-07 21:50:36,499 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:50:36,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:50:36,499 INFO L82 PathProgramCache]: Analyzing trace with hash -623699513, now seen corresponding path program 1 times [2019-12-07 21:50:36,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:50:36,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564186348] [2019-12-07 21:50:36,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:50:36,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:50:36,599 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 21:50:36,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564186348] [2019-12-07 21:50:36,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:50:36,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 21:50:36,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115317036] [2019-12-07 21:50:36,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 21:50:36,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:50:36,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 21:50:36,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-07 21:50:36,600 INFO L87 Difference]: Start difference. First operand 13877 states and 41802 transitions. Second operand 10 states. [2019-12-07 21:50:37,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:50:37,607 INFO L93 Difference]: Finished difference Result 27878 states and 83591 transitions. [2019-12-07 21:50:37,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 21:50:37,608 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-07 21:50:37,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:50:37,627 INFO L225 Difference]: With dead ends: 27878 [2019-12-07 21:50:37,627 INFO L226 Difference]: Without dead ends: 20916 [2019-12-07 21:50:37,627 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2019-12-07 21:50:37,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20916 states. [2019-12-07 21:50:37,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20916 to 14493. [2019-12-07 21:50:37,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14493 states. [2019-12-07 21:50:37,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14493 states to 14493 states and 43409 transitions. [2019-12-07 21:50:37,868 INFO L78 Accepts]: Start accepts. Automaton has 14493 states and 43409 transitions. Word has length 66 [2019-12-07 21:50:37,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:50:37,868 INFO L462 AbstractCegarLoop]: Abstraction has 14493 states and 43409 transitions. [2019-12-07 21:50:37,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 21:50:37,868 INFO L276 IsEmpty]: Start isEmpty. Operand 14493 states and 43409 transitions. [2019-12-07 21:50:37,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 21:50:37,880 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:50:37,881 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] [2019-12-07 21:50:37,881 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:50:37,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:50:37,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1795841111, now seen corresponding path program 2 times [2019-12-07 21:50:37,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:50:37,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236605479] [2019-12-07 21:50:37,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:50:37,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:50:38,001 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 21:50:38,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236605479] [2019-12-07 21:50:38,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:50:38,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 21:50:38,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595918181] [2019-12-07 21:50:38,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 21:50:38,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:50:38,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 21:50:38,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 21:50:38,002 INFO L87 Difference]: Start difference. First operand 14493 states and 43409 transitions. Second operand 11 states. [2019-12-07 21:50:39,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:50:39,474 INFO L93 Difference]: Finished difference Result 26803 states and 79686 transitions. [2019-12-07 21:50:39,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-07 21:50:39,474 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-07 21:50:39,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:50:39,502 INFO L225 Difference]: With dead ends: 26803 [2019-12-07 21:50:39,502 INFO L226 Difference]: Without dead ends: 22252 [2019-12-07 21:50:39,502 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=716, Unknown=0, NotChecked=0, Total=870 [2019-12-07 21:50:39,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22252 states. [2019-12-07 21:50:39,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22252 to 14493. [2019-12-07 21:50:39,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14493 states. [2019-12-07 21:50:39,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14493 states to 14493 states and 43217 transitions. [2019-12-07 21:50:39,765 INFO L78 Accepts]: Start accepts. Automaton has 14493 states and 43217 transitions. Word has length 66 [2019-12-07 21:50:39,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:50:39,765 INFO L462 AbstractCegarLoop]: Abstraction has 14493 states and 43217 transitions. [2019-12-07 21:50:39,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 21:50:39,765 INFO L276 IsEmpty]: Start isEmpty. Operand 14493 states and 43217 transitions. [2019-12-07 21:50:39,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 21:50:39,778 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:50:39,778 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] [2019-12-07 21:50:39,779 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:50:39,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:50:39,779 INFO L82 PathProgramCache]: Analyzing trace with hash -131673981, now seen corresponding path program 3 times [2019-12-07 21:50:39,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:50:39,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494584566] [2019-12-07 21:50:39,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:50:39,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:50:40,217 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 21:50:40,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494584566] [2019-12-07 21:50:40,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:50:40,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-07 21:50:40,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254987600] [2019-12-07 21:50:40,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 21:50:40,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:50:40,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 21:50:40,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2019-12-07 21:50:40,218 INFO L87 Difference]: Start difference. First operand 14493 states and 43217 transitions. Second operand 17 states. [2019-12-07 21:50:41,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:50:41,877 INFO L93 Difference]: Finished difference Result 20762 states and 60567 transitions. [2019-12-07 21:50:41,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-07 21:50:41,877 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2019-12-07 21:50:41,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:50:41,895 INFO L225 Difference]: With dead ends: 20762 [2019-12-07 21:50:41,895 INFO L226 Difference]: Without dead ends: 18371 [2019-12-07 21:50:41,896 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=311, Invalid=1329, Unknown=0, NotChecked=0, Total=1640 [2019-12-07 21:50:41,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18371 states. [2019-12-07 21:50:42,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18371 to 14958. [2019-12-07 21:50:42,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14958 states. [2019-12-07 21:50:42,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14958 states to 14958 states and 44429 transitions. [2019-12-07 21:50:42,126 INFO L78 Accepts]: Start accepts. Automaton has 14958 states and 44429 transitions. Word has length 66 [2019-12-07 21:50:42,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:50:42,126 INFO L462 AbstractCegarLoop]: Abstraction has 14958 states and 44429 transitions. [2019-12-07 21:50:42,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 21:50:42,126 INFO L276 IsEmpty]: Start isEmpty. Operand 14958 states and 44429 transitions. [2019-12-07 21:50:42,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 21:50:42,139 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:50:42,140 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] [2019-12-07 21:50:42,140 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:50:42,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:50:42,140 INFO L82 PathProgramCache]: Analyzing trace with hash 461520025, now seen corresponding path program 4 times [2019-12-07 21:50:42,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:50:42,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421163239] [2019-12-07 21:50:42,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:50:42,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:50:42,255 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 21:50:42,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421163239] [2019-12-07 21:50:42,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:50:42,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 21:50:42,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351155321] [2019-12-07 21:50:42,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 21:50:42,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:50:42,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 21:50:42,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-07 21:50:42,256 INFO L87 Difference]: Start difference. First operand 14958 states and 44429 transitions. Second operand 12 states. [2019-12-07 21:50:42,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:50:42,928 INFO L93 Difference]: Finished difference Result 33706 states and 99763 transitions. [2019-12-07 21:50:42,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-07 21:50:42,929 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-07 21:50:42,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:50:42,953 INFO L225 Difference]: With dead ends: 33706 [2019-12-07 21:50:42,953 INFO L226 Difference]: Without dead ends: 24545 [2019-12-07 21:50:42,954 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=216, Invalid=974, Unknown=0, NotChecked=0, Total=1190 [2019-12-07 21:50:43,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24545 states. [2019-12-07 21:50:43,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24545 to 13153. [2019-12-07 21:50:43,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13153 states. [2019-12-07 21:50:43,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13153 states to 13153 states and 39293 transitions. [2019-12-07 21:50:43,244 INFO L78 Accepts]: Start accepts. Automaton has 13153 states and 39293 transitions. Word has length 66 [2019-12-07 21:50:43,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:50:43,244 INFO L462 AbstractCegarLoop]: Abstraction has 13153 states and 39293 transitions. [2019-12-07 21:50:43,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 21:50:43,244 INFO L276 IsEmpty]: Start isEmpty. Operand 13153 states and 39293 transitions. [2019-12-07 21:50:43,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 21:50:43,256 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:50:43,256 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] [2019-12-07 21:50:43,256 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:50:43,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:50:43,256 INFO L82 PathProgramCache]: Analyzing trace with hash -663530261, now seen corresponding path program 5 times [2019-12-07 21:50:43,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:50:43,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768579023] [2019-12-07 21:50:43,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:50:43,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 21:50:43,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 21:50:43,327 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 21:50:43,327 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 21:50:43,330 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [907] [907] ULTIMATE.startENTRY-->L840: Formula: (let ((.cse0 (store |v_#valid_71| 0 0))) (and (= v_~main$tmp_guard0~0_40 0) (= 0 v_~b$r_buff1_thd1~0_173) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t873~0.base_30| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t873~0.base_30|) |v_ULTIMATE.start_main_~#t873~0.offset_22| 0)) |v_#memory_int_25|) (= 0 v_~__unbuffered_p1_EAX~0_44) (= 0 v_~x~0_134) (= v_~z~0_33 0) (= 0 v_~weak$$choice0~0_14) (= |v_#NULL.offset_6| 0) (= 0 v_~b$r_buff0_thd2~0_158) (= v_~__unbuffered_p2_EBX~0_34 0) (= 0 v_~b$read_delayed~0_7) (= v_~a~0_13 0) (= v_~b$w_buff1~0_227 0) (< 0 |v_#StackHeapBarrier_19|) (= v_~weak$$choice2~0_143 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t873~0.base_30|)) (= 0 v_~b$r_buff0_thd3~0_397) (= v_~b$r_buff1_thd0~0_151 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t873~0.base_30| 4)) (= 0 v_~b$r_buff1_thd3~0_304) (= 0 v_~b$r_buff0_thd1~0_258) (= v_~__unbuffered_p1_EBX~0_44 0) (= v_~__unbuffered_cnt~0_127 0) (= v_~b$read_delayed_var~0.offset_7 0) (= v_~b~0_156 0) (= v_~y~0_27 0) (= v_~main$tmp_guard1~0_28 0) (= 0 |v_#NULL.base_6|) (= 0 v_~__unbuffered_p2_EAX~0_34) (= v_~b$mem_tmp~0_17 0) (= 0 v_~b$r_buff1_thd2~0_163) (= v_~b$flush_delayed~0_32 0) (= 0 v_~b$w_buff1_used~0_458) (= 0 v_~b$w_buff0_used~0_811) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t873~0.base_30|) (= 0 |v_ULTIMATE.start_main_~#t873~0.offset_22|) (= v_~b$r_buff0_thd0~0_167 0) (= 0 v_~b$w_buff0~0_363) (= 0 v_~b$read_delayed_var~0.base_7) (= |v_#valid_69| (store .cse0 |v_ULTIMATE.start_main_~#t873~0.base_30| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_26|, #length=|v_#length_26|} OutVars{~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_397, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_173, ~b$read_delayed_var~0.offset=v_~b$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_64|, ULTIMATE.start_main_~#t875~0.offset=|v_ULTIMATE.start_main_~#t875~0.offset_15|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_38|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_38|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_811, ~a~0=v_~a~0_13, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_58|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, ULTIMATE.start_main_~#t873~0.base=|v_ULTIMATE.start_main_~#t873~0.base_30|, #length=|v_#length_25|, ~b$w_buff0~0=v_~b$w_buff0~0_363, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_167, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_158, ~b$mem_tmp~0=v_~b$mem_tmp~0_17, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ~b$flush_delayed~0=v_~b$flush_delayed~0_32, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~b$read_delayed~0=v_~b$read_delayed~0_7, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ~b$w_buff1~0=v_~b$w_buff1~0_227, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127, ~x~0=v_~x~0_134, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_258, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_28, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_105|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_42|, ULTIMATE.start_main_~#t874~0.offset=|v_ULTIMATE.start_main_~#t874~0.offset_15|, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_458, ULTIMATE.start_main_~#t875~0.base=|v_ULTIMATE.start_main_~#t875~0.base_18|, ~y~0=v_~y~0_27, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_163, ULTIMATE.start_main_~#t874~0.base=|v_ULTIMATE.start_main_~#t874~0.base_24|, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_151, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_44, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_19|, ULTIMATE.start_main_~#t873~0.offset=|v_ULTIMATE.start_main_~#t873~0.offset_22|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_40, #NULL.base=|v_#NULL.base_6|, ~b$read_delayed_var~0.base=v_~b$read_delayed_var~0.base_7, ~b~0=v_~b~0_156, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_25|, ~z~0=v_~z~0_33, ~weak$$choice2~0=v_~weak$$choice2~0_143, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_304} AuxVars[] AssignedVars[~b$r_buff0_thd3~0, ~b$r_buff1_thd1~0, ~b$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_~#t875~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ~b$w_buff0_used~0, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t873~0.base, #length, ~b$w_buff0~0, ~__unbuffered_p2_EAX~0, ~b$r_buff0_thd0~0, ~b$r_buff0_thd2~0, ~b$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~b$flush_delayed~0, ULTIMATE.start_main_#t~nondet45, ~b$read_delayed~0, ~weak$$choice0~0, ~b$w_buff1~0, ~__unbuffered_cnt~0, ~x~0, ~b$r_buff0_thd1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t874~0.offset, ~b$w_buff1_used~0, ULTIMATE.start_main_~#t875~0.base, ~y~0, ~b$r_buff1_thd2~0, ULTIMATE.start_main_~#t874~0.base, ~b$r_buff1_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_~#t873~0.offset, ULTIMATE.start_main_#t~nondet44, ~main$tmp_guard0~0, #NULL.base, ~b$read_delayed_var~0.base, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~b$r_buff1_thd3~0] because there is no mapped edge [2019-12-07 21:50:43,331 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L840-1-->L842: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t874~0.offset_10|) (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t874~0.base_12| 1) |v_#valid_38|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t874~0.base_12|) (not (= |v_ULTIMATE.start_main_~#t874~0.base_12| 0)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t874~0.base_12| 4) |v_#length_17|) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t874~0.base_12|)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t874~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t874~0.base_12|) |v_ULTIMATE.start_main_~#t874~0.offset_10| 1)) |v_#memory_int_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t874~0.base=|v_ULTIMATE.start_main_~#t874~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t874~0.offset=|v_ULTIMATE.start_main_~#t874~0.offset_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_17|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t874~0.base, ULTIMATE.start_main_~#t874~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 21:50:43,331 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L4-->L752: Formula: (and (= ~b$r_buff0_thd0~0_In-1320784495 ~b$r_buff1_thd0~0_Out-1320784495) (= ~b$r_buff0_thd1~0_Out-1320784495 1) (= ~x~0_Out-1320784495 1) (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1320784495 0)) (= ~b$r_buff0_thd2~0_In-1320784495 ~b$r_buff1_thd2~0_Out-1320784495) (= ~b$r_buff1_thd3~0_Out-1320784495 ~b$r_buff0_thd3~0_In-1320784495) (= ~b$r_buff0_thd1~0_In-1320784495 ~b$r_buff1_thd1~0_Out-1320784495)) InVars {~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-1320784495, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-1320784495, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1320784495, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1320784495, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-1320784495} OutVars{~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_Out-1320784495, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-1320784495, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1320784495, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_Out-1320784495, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_Out-1320784495, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1320784495, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_Out-1320784495, ~x~0=~x~0_Out-1320784495, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_Out-1320784495, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-1320784495} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, ~b$r_buff1_thd1~0, ~b$r_buff1_thd0~0, ~b$r_buff1_thd2~0, ~x~0, ~b$r_buff1_thd3~0] because there is no mapped edge [2019-12-07 21:50:43,332 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L778-2-->L778-5: Formula: (let ((.cse0 (= 0 (mod ~b$w_buff1_used~0_In679204661 256))) (.cse2 (= 0 (mod ~b$r_buff1_thd2~0_In679204661 256))) (.cse1 (= |P1Thread1of1ForFork2_#t~ite10_Out679204661| |P1Thread1of1ForFork2_#t~ite9_Out679204661|))) (or (and (= ~b$w_buff1~0_In679204661 |P1Thread1of1ForFork2_#t~ite9_Out679204661|) (not .cse0) .cse1 (not .cse2)) (and (or .cse0 .cse2) (= ~b~0_In679204661 |P1Thread1of1ForFork2_#t~ite9_Out679204661|) .cse1))) InVars {~b$w_buff1_used~0=~b$w_buff1_used~0_In679204661, ~b~0=~b~0_In679204661, ~b$w_buff1~0=~b$w_buff1~0_In679204661, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In679204661} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out679204661|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In679204661, ~b~0=~b~0_In679204661, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out679204661|, ~b$w_buff1~0=~b$w_buff1~0_In679204661, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In679204661} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-07 21:50:43,333 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L753-->L753-2: Formula: (let ((.cse0 (= (mod ~b$w_buff0_used~0_In1622819839 256) 0)) (.cse1 (= 0 (mod ~b$r_buff0_thd1~0_In1622819839 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out1622819839|)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out1622819839| ~b$w_buff0_used~0_In1622819839)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1622819839, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In1622819839} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1622819839, P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out1622819839|, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In1622819839} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-07 21:50:43,333 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L754-->L754-2: Formula: (let ((.cse3 (= 0 (mod ~b$r_buff0_thd1~0_In1599446918 256))) (.cse2 (= 0 (mod ~b$w_buff0_used~0_In1599446918 256))) (.cse0 (= 0 (mod ~b$w_buff1_used~0_In1599446918 256))) (.cse1 (= 0 (mod ~b$r_buff1_thd1~0_In1599446918 256)))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite6_Out1599446918|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~b$w_buff1_used~0_In1599446918 |P0Thread1of1ForFork1_#t~ite6_Out1599446918|) (or .cse0 .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1599446918, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In1599446918, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In1599446918, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1599446918} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1599446918, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In1599446918, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In1599446918, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1599446918, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out1599446918|} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-07 21:50:43,334 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L779-->L779-2: Formula: (let ((.cse0 (= (mod ~b$w_buff0_used~0_In-7714752 256) 0)) (.cse1 (= 0 (mod ~b$r_buff0_thd2~0_In-7714752 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out-7714752|) (not .cse1)) (and (or .cse0 .cse1) (= ~b$w_buff0_used~0_In-7714752 |P1Thread1of1ForFork2_#t~ite11_Out-7714752|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-7714752, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-7714752} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-7714752, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-7714752, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-7714752|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 21:50:43,334 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L755-->L756: Formula: (let ((.cse1 (= (mod ~b$r_buff0_thd1~0_In-782376031 256) 0)) (.cse2 (= ~b$r_buff0_thd1~0_In-782376031 ~b$r_buff0_thd1~0_Out-782376031)) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In-782376031 256)))) (or (and (not .cse0) (= 0 ~b$r_buff0_thd1~0_Out-782376031) (not .cse1)) (and .cse2 .cse1) (and .cse2 .cse0))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-782376031, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-782376031} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-782376031, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_Out-782376031, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-782376031|} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite7] because there is no mapped edge [2019-12-07 21:50:43,334 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L756-->L756-2: Formula: (let ((.cse1 (= 0 (mod ~b$w_buff0_used~0_In-174615172 256))) (.cse0 (= (mod ~b$r_buff0_thd1~0_In-174615172 256) 0)) (.cse2 (= (mod ~b$w_buff1_used~0_In-174615172 256) 0)) (.cse3 (= (mod ~b$r_buff1_thd1~0_In-174615172 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite8_Out-174615172| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite8_Out-174615172| ~b$r_buff1_thd1~0_In-174615172)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-174615172, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-174615172, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-174615172, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-174615172} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-174615172, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-174615172, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-174615172, P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-174615172|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-174615172} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 21:50:43,334 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L756-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.base_3|) (= v_~b$r_buff1_thd1~0_107 |v_P0Thread1of1ForFork1_#t~ite8_46|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_87 1) v_~__unbuffered_cnt~0_86)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_46|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87} OutVars{~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_107, P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_45|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_3|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86} AuxVars[] AssignedVars[~b$r_buff1_thd1~0, P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 21:50:43,334 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L842-1-->L844: Formula: (and (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t875~0.base_12| 4) |v_#length_15|) (= 0 |v_ULTIMATE.start_main_~#t875~0.offset_10|) (not (= 0 |v_ULTIMATE.start_main_~#t875~0.base_12|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t875~0.base_12|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t875~0.base_12|)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t875~0.base_12| 1)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t875~0.base_12| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t875~0.base_12|) |v_ULTIMATE.start_main_~#t875~0.offset_10| 2)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t875~0.base=|v_ULTIMATE.start_main_~#t875~0.base_12|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_4|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t875~0.offset=|v_ULTIMATE.start_main_~#t875~0.offset_10|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t875~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t875~0.offset, #length] because there is no mapped edge [2019-12-07 21:50:43,337 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L809-->L809-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1176870620 256)))) (or (and (= ~b$w_buff1_used~0_In-1176870620 |P2Thread1of1ForFork0_#t~ite29_Out-1176870620|) .cse0 (= |P2Thread1of1ForFork0_#t~ite29_Out-1176870620| |P2Thread1of1ForFork0_#t~ite30_Out-1176870620|) (let ((.cse1 (= (mod ~b$r_buff0_thd3~0_In-1176870620 256) 0))) (or (and .cse1 (= 0 (mod ~b$w_buff1_used~0_In-1176870620 256))) (and .cse1 (= 0 (mod ~b$r_buff1_thd3~0_In-1176870620 256))) (= (mod ~b$w_buff0_used~0_In-1176870620 256) 0)))) (and (= |P2Thread1of1ForFork0_#t~ite29_In-1176870620| |P2Thread1of1ForFork0_#t~ite29_Out-1176870620|) (= ~b$w_buff1_used~0_In-1176870620 |P2Thread1of1ForFork0_#t~ite30_Out-1176870620|) (not .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1176870620, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1176870620, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1176870620, ~weak$$choice2~0=~weak$$choice2~0_In-1176870620, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In-1176870620|, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-1176870620} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1176870620, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1176870620, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1176870620, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out-1176870620|, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-1176870620|, ~weak$$choice2~0=~weak$$choice2~0_In-1176870620, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-1176870620} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 21:50:43,338 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [897] [897] L810-->L811-8: Formula: (and (= |v_P2Thread1of1ForFork0_#t~ite36_36| v_~b$r_buff1_thd3~0_279) (= v_~b$r_buff0_thd3~0_376 v_~b$r_buff0_thd3~0_375) (not (= 0 (mod v_~weak$$choice2~0_126 256))) (= |v_P2Thread1of1ForFork0_#t~ite34_29| |v_P2Thread1of1ForFork0_#t~ite34_28|) (= |v_P2Thread1of1ForFork0_#t~ite35_33| |v_P2Thread1of1ForFork0_#t~ite35_32|)) InVars {~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_376, P2Thread1of1ForFork0_#t~ite35=|v_P2Thread1of1ForFork0_#t~ite35_33|, P2Thread1of1ForFork0_#t~ite34=|v_P2Thread1of1ForFork0_#t~ite34_29|, ~weak$$choice2~0=v_~weak$$choice2~0_126, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_279} OutVars{P2Thread1of1ForFork0_#t~ite36=|v_P2Thread1of1ForFork0_#t~ite36_36|, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_375, P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_23|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_32|, P2Thread1of1ForFork0_#t~ite35=|v_P2Thread1of1ForFork0_#t~ite35_32|, P2Thread1of1ForFork0_#t~ite34=|v_P2Thread1of1ForFork0_#t~ite34_28|, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_25|, ~weak$$choice2~0=v_~weak$$choice2~0_126, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_279} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite36, ~b$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, P2Thread1of1ForFork0_#t~ite35, P2Thread1of1ForFork0_#t~ite34, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 21:50:43,338 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L813-->L817: Formula: (and (= v_~b$flush_delayed~0_6 0) (not (= (mod v_~b$flush_delayed~0_7 256) 0)) (= v_~b~0_16 v_~b$mem_tmp~0_4)) InVars {~b$mem_tmp~0=v_~b$mem_tmp~0_4, ~b$flush_delayed~0=v_~b$flush_delayed~0_7} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_5|, ~b$mem_tmp~0=v_~b$mem_tmp~0_4, ~b~0=v_~b~0_16, ~b$flush_delayed~0=v_~b$flush_delayed~0_6} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~b~0, ~b$flush_delayed~0] because there is no mapped edge [2019-12-07 21:50:43,339 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L817-2-->L817-5: Formula: (let ((.cse2 (= (mod ~b$r_buff1_thd3~0_In-478784908 256) 0)) (.cse0 (= 0 (mod ~b$w_buff1_used~0_In-478784908 256))) (.cse1 (= |P2Thread1of1ForFork0_#t~ite39_Out-478784908| |P2Thread1of1ForFork0_#t~ite38_Out-478784908|))) (or (and (not .cse0) (= ~b$w_buff1~0_In-478784908 |P2Thread1of1ForFork0_#t~ite38_Out-478784908|) .cse1 (not .cse2)) (and (or .cse2 .cse0) .cse1 (= ~b~0_In-478784908 |P2Thread1of1ForFork0_#t~ite38_Out-478784908|)))) InVars {~b$w_buff1_used~0=~b$w_buff1_used~0_In-478784908, ~b~0=~b~0_In-478784908, ~b$w_buff1~0=~b$w_buff1~0_In-478784908, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-478784908} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out-478784908|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-478784908|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-478784908, ~b~0=~b~0_In-478784908, ~b$w_buff1~0=~b$w_buff1~0_In-478784908, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-478784908} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-07 21:50:43,339 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L818-->L818-2: Formula: (let ((.cse0 (= (mod ~b$w_buff0_used~0_In426257613 256) 0)) (.cse1 (= (mod ~b$r_buff0_thd3~0_In426257613 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out426257613| 0)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out426257613| ~b$w_buff0_used~0_In426257613)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In426257613, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In426257613} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In426257613, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In426257613, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out426257613|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-07 21:50:43,340 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L819-->L819-2: Formula: (let ((.cse2 (= (mod ~b$w_buff1_used~0_In1401693918 256) 0)) (.cse3 (= (mod ~b$r_buff1_thd3~0_In1401693918 256) 0)) (.cse1 (= 0 (mod ~b$r_buff0_thd3~0_In1401693918 256))) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In1401693918 256)))) (or (and (= ~b$w_buff1_used~0_In1401693918 |P2Thread1of1ForFork0_#t~ite41_Out1401693918|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork0_#t~ite41_Out1401693918|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1401693918, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1401693918, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1401693918, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In1401693918} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1401693918, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1401693918, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1401693918, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out1401693918|, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In1401693918} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-07 21:50:43,340 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L820-->L820-2: Formula: (let ((.cse1 (= 0 (mod ~b$w_buff0_used~0_In-1933865829 256))) (.cse0 (= 0 (mod ~b$r_buff0_thd3~0_In-1933865829 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out-1933865829| 0)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out-1933865829| ~b$r_buff0_thd3~0_In-1933865829) (or .cse1 .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1933865829, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1933865829} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1933865829, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1933865829, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-1933865829|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 21:50:43,340 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L821-->L821-2: Formula: (let ((.cse2 (= 0 (mod ~b$r_buff1_thd3~0_In262755449 256))) (.cse3 (= (mod ~b$w_buff1_used~0_In262755449 256) 0)) (.cse1 (= (mod ~b$w_buff0_used~0_In262755449 256) 0)) (.cse0 (= (mod ~b$r_buff0_thd3~0_In262755449 256) 0))) (or (and (= ~b$r_buff1_thd3~0_In262755449 |P2Thread1of1ForFork0_#t~ite43_Out262755449|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite43_Out262755449|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In262755449, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In262755449, ~b$w_buff1_used~0=~b$w_buff1_used~0_In262755449, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In262755449} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In262755449, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In262755449, P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out262755449|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In262755449, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In262755449} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-07 21:50:43,340 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L821-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0) (= |v_P2Thread1of1ForFork0_#t~ite43_34| v_~b$r_buff1_thd3~0_101)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_101, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~__unbuffered_cnt~0, ~b$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 21:50:43,341 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L780-->L780-2: Formula: (let ((.cse2 (= (mod ~b$w_buff1_used~0_In-550721285 256) 0)) (.cse3 (= (mod ~b$r_buff1_thd2~0_In-550721285 256) 0)) (.cse1 (= 0 (mod ~b$w_buff0_used~0_In-550721285 256))) (.cse0 (= (mod ~b$r_buff0_thd2~0_In-550721285 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite12_Out-550721285| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~b$w_buff1_used~0_In-550721285 |P1Thread1of1ForFork2_#t~ite12_Out-550721285|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-550721285, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-550721285, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-550721285, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-550721285} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-550721285, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-550721285, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-550721285, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-550721285|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-550721285} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-07 21:50:43,341 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L781-->L781-2: Formula: (let ((.cse1 (= 0 (mod ~b$r_buff0_thd2~0_In1162988879 256))) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In1162988879 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out1162988879|) (not .cse1)) (and (or .cse1 .cse0) (= ~b$r_buff0_thd2~0_In1162988879 |P1Thread1of1ForFork2_#t~ite13_Out1162988879|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1162988879, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1162988879} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1162988879, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1162988879, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out1162988879|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-07 21:50:43,342 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L782-->L782-2: Formula: (let ((.cse3 (= 0 (mod ~b$r_buff0_thd2~0_In1777596281 256))) (.cse2 (= 0 (mod ~b$w_buff0_used~0_In1777596281 256))) (.cse1 (= 0 (mod ~b$w_buff1_used~0_In1777596281 256))) (.cse0 (= 0 (mod ~b$r_buff1_thd2~0_In1777596281 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite14_Out1777596281| ~b$r_buff1_thd2~0_In1777596281) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork2_#t~ite14_Out1777596281| 0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1777596281, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1777596281, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1777596281, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In1777596281} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1777596281, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1777596281, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1777596281, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out1777596281|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In1777596281} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 21:50:43,342 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L782-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= v_~b$r_buff1_thd2~0_91 |v_P1Thread1of1ForFork2_#t~ite14_50|) (= (+ v_~__unbuffered_cnt~0_81 1) v_~__unbuffered_cnt~0_80)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_81, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_50|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_49|, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_91, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, ~b$r_buff1_thd2~0, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-07 21:50:43,342 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L848-->L850-2: Formula: (and (or (= 0 (mod v_~b$w_buff0_used~0_159 256)) (= 0 (mod v_~b$r_buff0_thd0~0_23 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_159, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_23} OutVars{~b$w_buff0_used~0=v_~b$w_buff0_used~0_159, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_23} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 21:50:43,342 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L850-2-->L850-4: Formula: (let ((.cse1 (= 0 (mod ~b$r_buff1_thd0~0_In1379683829 256))) (.cse0 (= (mod ~b$w_buff1_used~0_In1379683829 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out1379683829| ~b~0_In1379683829) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite47_Out1379683829| ~b$w_buff1~0_In1379683829) (not .cse0)))) InVars {~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In1379683829, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1379683829, ~b~0=~b~0_In1379683829, ~b$w_buff1~0=~b$w_buff1~0_In1379683829} OutVars{~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In1379683829, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1379683829, ~b~0=~b~0_In1379683829, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1379683829|, ~b$w_buff1~0=~b$w_buff1~0_In1379683829} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-07 21:50:43,342 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L850-4-->L851: Formula: (= v_~b~0_28 |v_ULTIMATE.start_main_#t~ite47_9|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_9|} OutVars{~b~0=v_~b~0_28, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_8|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_12|} AuxVars[] AssignedVars[~b~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-07 21:50:43,342 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L851-->L851-2: Formula: (let ((.cse1 (= 0 (mod ~b$w_buff0_used~0_In-503054881 256))) (.cse0 (= 0 (mod ~b$r_buff0_thd0~0_In-503054881 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite49_Out-503054881|) (not .cse1)) (and (or .cse1 .cse0) (= ~b$w_buff0_used~0_In-503054881 |ULTIMATE.start_main_#t~ite49_Out-503054881|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-503054881, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-503054881} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-503054881, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-503054881|, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-503054881} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-07 21:50:43,343 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L852-->L852-2: Formula: (let ((.cse2 (= (mod ~b$w_buff0_used~0_In544716352 256) 0)) (.cse3 (= 0 (mod ~b$r_buff0_thd0~0_In544716352 256))) (.cse0 (= (mod ~b$w_buff1_used~0_In544716352 256) 0)) (.cse1 (= (mod ~b$r_buff1_thd0~0_In544716352 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite50_Out544716352| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite50_Out544716352| ~b$w_buff1_used~0_In544716352) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In544716352, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In544716352, ~b$w_buff1_used~0=~b$w_buff1_used~0_In544716352, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In544716352} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out544716352|, ~b$w_buff0_used~0=~b$w_buff0_used~0_In544716352, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In544716352, ~b$w_buff1_used~0=~b$w_buff1_used~0_In544716352, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In544716352} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-07 21:50:43,343 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L853-->L853-2: Formula: (let ((.cse0 (= (mod ~b$w_buff0_used~0_In76164877 256) 0)) (.cse1 (= (mod ~b$r_buff0_thd0~0_In76164877 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out76164877| 0)) (and (or .cse0 .cse1) (= ~b$r_buff0_thd0~0_In76164877 |ULTIMATE.start_main_#t~ite51_Out76164877|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In76164877, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In76164877} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In76164877, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out76164877|, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In76164877} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-07 21:50:43,344 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L854-->L854-2: Formula: (let ((.cse3 (= 0 (mod ~b$r_buff0_thd0~0_In-2119238586 256))) (.cse2 (= 0 (mod ~b$w_buff0_used~0_In-2119238586 256))) (.cse1 (= (mod ~b$r_buff1_thd0~0_In-2119238586 256) 0)) (.cse0 (= 0 (mod ~b$w_buff1_used~0_In-2119238586 256)))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out-2119238586| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite52_Out-2119238586| ~b$r_buff1_thd0~0_In-2119238586) (or .cse1 .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-2119238586, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-2119238586, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-2119238586, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-2119238586} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-2119238586, ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-2119238586|, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-2119238586, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-2119238586, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-2119238586} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-07 21:50:43,344 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] L854-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|) (= v_~main$tmp_guard1~0_17 (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p1_EAX~0_30) (= v_~__unbuffered_p2_EBX~0_21 0) (= v_~x~0_96 2) (= v_~__unbuffered_p1_EBX~0_30 0) (= 1 v_~__unbuffered_p2_EAX~0_23))) 1 0)) 0 1)) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0) (= v_~b$r_buff1_thd0~0_116 |v_ULTIMATE.start_main_#t~ite52_39|)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_39|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_30, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_21, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_30, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_96} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_30, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_21, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_116, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_30, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_96, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~b$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 21:50:43,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 09:50:43 BasicIcfg [2019-12-07 21:50:43,399 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 21:50:43,399 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 21:50:43,399 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 21:50:43,399 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 21:50:43,400 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:47:16" (3/4) ... [2019-12-07 21:50:43,401 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 21:50:43,402 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [907] [907] ULTIMATE.startENTRY-->L840: Formula: (let ((.cse0 (store |v_#valid_71| 0 0))) (and (= v_~main$tmp_guard0~0_40 0) (= 0 v_~b$r_buff1_thd1~0_173) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t873~0.base_30| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t873~0.base_30|) |v_ULTIMATE.start_main_~#t873~0.offset_22| 0)) |v_#memory_int_25|) (= 0 v_~__unbuffered_p1_EAX~0_44) (= 0 v_~x~0_134) (= v_~z~0_33 0) (= 0 v_~weak$$choice0~0_14) (= |v_#NULL.offset_6| 0) (= 0 v_~b$r_buff0_thd2~0_158) (= v_~__unbuffered_p2_EBX~0_34 0) (= 0 v_~b$read_delayed~0_7) (= v_~a~0_13 0) (= v_~b$w_buff1~0_227 0) (< 0 |v_#StackHeapBarrier_19|) (= v_~weak$$choice2~0_143 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t873~0.base_30|)) (= 0 v_~b$r_buff0_thd3~0_397) (= v_~b$r_buff1_thd0~0_151 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t873~0.base_30| 4)) (= 0 v_~b$r_buff1_thd3~0_304) (= 0 v_~b$r_buff0_thd1~0_258) (= v_~__unbuffered_p1_EBX~0_44 0) (= v_~__unbuffered_cnt~0_127 0) (= v_~b$read_delayed_var~0.offset_7 0) (= v_~b~0_156 0) (= v_~y~0_27 0) (= v_~main$tmp_guard1~0_28 0) (= 0 |v_#NULL.base_6|) (= 0 v_~__unbuffered_p2_EAX~0_34) (= v_~b$mem_tmp~0_17 0) (= 0 v_~b$r_buff1_thd2~0_163) (= v_~b$flush_delayed~0_32 0) (= 0 v_~b$w_buff1_used~0_458) (= 0 v_~b$w_buff0_used~0_811) (< |v_#StackHeapBarrier_19| |v_ULTIMATE.start_main_~#t873~0.base_30|) (= 0 |v_ULTIMATE.start_main_~#t873~0.offset_22|) (= v_~b$r_buff0_thd0~0_167 0) (= 0 v_~b$w_buff0~0_363) (= 0 v_~b$read_delayed_var~0.base_7) (= |v_#valid_69| (store .cse0 |v_ULTIMATE.start_main_~#t873~0.base_30| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_19|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_26|, #length=|v_#length_26|} OutVars{~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_397, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_173, ~b$read_delayed_var~0.offset=v_~b$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_64|, ULTIMATE.start_main_~#t875~0.offset=|v_ULTIMATE.start_main_~#t875~0.offset_15|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_38|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_38|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_811, ~a~0=v_~a~0_13, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_58|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, ULTIMATE.start_main_~#t873~0.base=|v_ULTIMATE.start_main_~#t873~0.base_30|, #length=|v_#length_25|, ~b$w_buff0~0=v_~b$w_buff0~0_363, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_167, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_158, ~b$mem_tmp~0=v_~b$mem_tmp~0_17, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ~b$flush_delayed~0=v_~b$flush_delayed~0_32, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~b$read_delayed~0=v_~b$read_delayed~0_7, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_19|, ~b$w_buff1~0=v_~b$w_buff1~0_227, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127, ~x~0=v_~x~0_134, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_258, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_28, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_105|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_42|, ULTIMATE.start_main_~#t874~0.offset=|v_ULTIMATE.start_main_~#t874~0.offset_15|, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_458, ULTIMATE.start_main_~#t875~0.base=|v_ULTIMATE.start_main_~#t875~0.base_18|, ~y~0=v_~y~0_27, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_163, ULTIMATE.start_main_~#t874~0.base=|v_ULTIMATE.start_main_~#t874~0.base_24|, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_151, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_44, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_19|, ULTIMATE.start_main_~#t873~0.offset=|v_ULTIMATE.start_main_~#t873~0.offset_22|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_40, #NULL.base=|v_#NULL.base_6|, ~b$read_delayed_var~0.base=v_~b$read_delayed_var~0.base_7, ~b~0=v_~b~0_156, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_25|, ~z~0=v_~z~0_33, ~weak$$choice2~0=v_~weak$$choice2~0_143, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_304} AuxVars[] AssignedVars[~b$r_buff0_thd3~0, ~b$r_buff1_thd1~0, ~b$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_~#t875~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ~b$w_buff0_used~0, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t873~0.base, #length, ~b$w_buff0~0, ~__unbuffered_p2_EAX~0, ~b$r_buff0_thd0~0, ~b$r_buff0_thd2~0, ~b$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~b$flush_delayed~0, ULTIMATE.start_main_#t~nondet45, ~b$read_delayed~0, ~weak$$choice0~0, ~b$w_buff1~0, ~__unbuffered_cnt~0, ~x~0, ~b$r_buff0_thd1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t874~0.offset, ~b$w_buff1_used~0, ULTIMATE.start_main_~#t875~0.base, ~y~0, ~b$r_buff1_thd2~0, ULTIMATE.start_main_~#t874~0.base, ~b$r_buff1_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_~#t873~0.offset, ULTIMATE.start_main_#t~nondet44, ~main$tmp_guard0~0, #NULL.base, ~b$read_delayed_var~0.base, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~b$r_buff1_thd3~0] because there is no mapped edge [2019-12-07 21:50:43,402 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L840-1-->L842: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t874~0.offset_10|) (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t874~0.base_12| 1) |v_#valid_38|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t874~0.base_12|) (not (= |v_ULTIMATE.start_main_~#t874~0.base_12| 0)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t874~0.base_12| 4) |v_#length_17|) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t874~0.base_12|)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t874~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t874~0.base_12|) |v_ULTIMATE.start_main_~#t874~0.offset_10| 1)) |v_#memory_int_17|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t874~0.base=|v_ULTIMATE.start_main_~#t874~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t874~0.offset=|v_ULTIMATE.start_main_~#t874~0.offset_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_17|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t874~0.base, ULTIMATE.start_main_~#t874~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 21:50:43,403 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L4-->L752: Formula: (and (= ~b$r_buff0_thd0~0_In-1320784495 ~b$r_buff1_thd0~0_Out-1320784495) (= ~b$r_buff0_thd1~0_Out-1320784495 1) (= ~x~0_Out-1320784495 1) (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1320784495 0)) (= ~b$r_buff0_thd2~0_In-1320784495 ~b$r_buff1_thd2~0_Out-1320784495) (= ~b$r_buff1_thd3~0_Out-1320784495 ~b$r_buff0_thd3~0_In-1320784495) (= ~b$r_buff0_thd1~0_In-1320784495 ~b$r_buff1_thd1~0_Out-1320784495)) InVars {~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-1320784495, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-1320784495, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1320784495, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1320784495, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-1320784495} OutVars{~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_Out-1320784495, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-1320784495, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1320784495, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_Out-1320784495, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_Out-1320784495, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1320784495, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_Out-1320784495, ~x~0=~x~0_Out-1320784495, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_Out-1320784495, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-1320784495} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, ~b$r_buff1_thd1~0, ~b$r_buff1_thd0~0, ~b$r_buff1_thd2~0, ~x~0, ~b$r_buff1_thd3~0] because there is no mapped edge [2019-12-07 21:50:43,403 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L778-2-->L778-5: Formula: (let ((.cse0 (= 0 (mod ~b$w_buff1_used~0_In679204661 256))) (.cse2 (= 0 (mod ~b$r_buff1_thd2~0_In679204661 256))) (.cse1 (= |P1Thread1of1ForFork2_#t~ite10_Out679204661| |P1Thread1of1ForFork2_#t~ite9_Out679204661|))) (or (and (= ~b$w_buff1~0_In679204661 |P1Thread1of1ForFork2_#t~ite9_Out679204661|) (not .cse0) .cse1 (not .cse2)) (and (or .cse0 .cse2) (= ~b~0_In679204661 |P1Thread1of1ForFork2_#t~ite9_Out679204661|) .cse1))) InVars {~b$w_buff1_used~0=~b$w_buff1_used~0_In679204661, ~b~0=~b~0_In679204661, ~b$w_buff1~0=~b$w_buff1~0_In679204661, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In679204661} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out679204661|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In679204661, ~b~0=~b~0_In679204661, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out679204661|, ~b$w_buff1~0=~b$w_buff1~0_In679204661, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In679204661} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-07 21:50:43,404 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L753-->L753-2: Formula: (let ((.cse0 (= (mod ~b$w_buff0_used~0_In1622819839 256) 0)) (.cse1 (= 0 (mod ~b$r_buff0_thd1~0_In1622819839 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out1622819839|)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out1622819839| ~b$w_buff0_used~0_In1622819839)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1622819839, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In1622819839} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1622819839, P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out1622819839|, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In1622819839} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-07 21:50:43,404 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L754-->L754-2: Formula: (let ((.cse3 (= 0 (mod ~b$r_buff0_thd1~0_In1599446918 256))) (.cse2 (= 0 (mod ~b$w_buff0_used~0_In1599446918 256))) (.cse0 (= 0 (mod ~b$w_buff1_used~0_In1599446918 256))) (.cse1 (= 0 (mod ~b$r_buff1_thd1~0_In1599446918 256)))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite6_Out1599446918|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~b$w_buff1_used~0_In1599446918 |P0Thread1of1ForFork1_#t~ite6_Out1599446918|) (or .cse0 .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1599446918, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In1599446918, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In1599446918, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1599446918} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1599446918, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In1599446918, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In1599446918, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1599446918, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out1599446918|} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-07 21:50:43,405 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L779-->L779-2: Formula: (let ((.cse0 (= (mod ~b$w_buff0_used~0_In-7714752 256) 0)) (.cse1 (= 0 (mod ~b$r_buff0_thd2~0_In-7714752 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out-7714752|) (not .cse1)) (and (or .cse0 .cse1) (= ~b$w_buff0_used~0_In-7714752 |P1Thread1of1ForFork2_#t~ite11_Out-7714752|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-7714752, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-7714752} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-7714752, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-7714752, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-7714752|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 21:50:43,405 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L755-->L756: Formula: (let ((.cse1 (= (mod ~b$r_buff0_thd1~0_In-782376031 256) 0)) (.cse2 (= ~b$r_buff0_thd1~0_In-782376031 ~b$r_buff0_thd1~0_Out-782376031)) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In-782376031 256)))) (or (and (not .cse0) (= 0 ~b$r_buff0_thd1~0_Out-782376031) (not .cse1)) (and .cse2 .cse1) (and .cse2 .cse0))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-782376031, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-782376031} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-782376031, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_Out-782376031, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-782376031|} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite7] because there is no mapped edge [2019-12-07 21:50:43,405 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L756-->L756-2: Formula: (let ((.cse1 (= 0 (mod ~b$w_buff0_used~0_In-174615172 256))) (.cse0 (= (mod ~b$r_buff0_thd1~0_In-174615172 256) 0)) (.cse2 (= (mod ~b$w_buff1_used~0_In-174615172 256) 0)) (.cse3 (= (mod ~b$r_buff1_thd1~0_In-174615172 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite8_Out-174615172| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite8_Out-174615172| ~b$r_buff1_thd1~0_In-174615172)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-174615172, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-174615172, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-174615172, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-174615172} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-174615172, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-174615172, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-174615172, P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-174615172|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-174615172} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 21:50:43,405 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L756-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.base_3|) (= v_~b$r_buff1_thd1~0_107 |v_P0Thread1of1ForFork1_#t~ite8_46|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_87 1) v_~__unbuffered_cnt~0_86)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_46|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87} OutVars{~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_107, P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_45|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_3|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86} AuxVars[] AssignedVars[~b$r_buff1_thd1~0, P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 21:50:43,405 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L842-1-->L844: Formula: (and (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t875~0.base_12| 4) |v_#length_15|) (= 0 |v_ULTIMATE.start_main_~#t875~0.offset_10|) (not (= 0 |v_ULTIMATE.start_main_~#t875~0.base_12|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t875~0.base_12|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t875~0.base_12|)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t875~0.base_12| 1)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t875~0.base_12| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t875~0.base_12|) |v_ULTIMATE.start_main_~#t875~0.offset_10| 2)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t875~0.base=|v_ULTIMATE.start_main_~#t875~0.base_12|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_4|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t875~0.offset=|v_ULTIMATE.start_main_~#t875~0.offset_10|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t875~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t875~0.offset, #length] because there is no mapped edge [2019-12-07 21:50:43,408 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L809-->L809-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1176870620 256)))) (or (and (= ~b$w_buff1_used~0_In-1176870620 |P2Thread1of1ForFork0_#t~ite29_Out-1176870620|) .cse0 (= |P2Thread1of1ForFork0_#t~ite29_Out-1176870620| |P2Thread1of1ForFork0_#t~ite30_Out-1176870620|) (let ((.cse1 (= (mod ~b$r_buff0_thd3~0_In-1176870620 256) 0))) (or (and .cse1 (= 0 (mod ~b$w_buff1_used~0_In-1176870620 256))) (and .cse1 (= 0 (mod ~b$r_buff1_thd3~0_In-1176870620 256))) (= (mod ~b$w_buff0_used~0_In-1176870620 256) 0)))) (and (= |P2Thread1of1ForFork0_#t~ite29_In-1176870620| |P2Thread1of1ForFork0_#t~ite29_Out-1176870620|) (= ~b$w_buff1_used~0_In-1176870620 |P2Thread1of1ForFork0_#t~ite30_Out-1176870620|) (not .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1176870620, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1176870620, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1176870620, ~weak$$choice2~0=~weak$$choice2~0_In-1176870620, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In-1176870620|, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-1176870620} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1176870620, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1176870620, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1176870620, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out-1176870620|, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-1176870620|, ~weak$$choice2~0=~weak$$choice2~0_In-1176870620, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-1176870620} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 21:50:43,409 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [897] [897] L810-->L811-8: Formula: (and (= |v_P2Thread1of1ForFork0_#t~ite36_36| v_~b$r_buff1_thd3~0_279) (= v_~b$r_buff0_thd3~0_376 v_~b$r_buff0_thd3~0_375) (not (= 0 (mod v_~weak$$choice2~0_126 256))) (= |v_P2Thread1of1ForFork0_#t~ite34_29| |v_P2Thread1of1ForFork0_#t~ite34_28|) (= |v_P2Thread1of1ForFork0_#t~ite35_33| |v_P2Thread1of1ForFork0_#t~ite35_32|)) InVars {~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_376, P2Thread1of1ForFork0_#t~ite35=|v_P2Thread1of1ForFork0_#t~ite35_33|, P2Thread1of1ForFork0_#t~ite34=|v_P2Thread1of1ForFork0_#t~ite34_29|, ~weak$$choice2~0=v_~weak$$choice2~0_126, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_279} OutVars{P2Thread1of1ForFork0_#t~ite36=|v_P2Thread1of1ForFork0_#t~ite36_36|, ~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_375, P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_23|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_32|, P2Thread1of1ForFork0_#t~ite35=|v_P2Thread1of1ForFork0_#t~ite35_32|, P2Thread1of1ForFork0_#t~ite34=|v_P2Thread1of1ForFork0_#t~ite34_28|, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_25|, ~weak$$choice2~0=v_~weak$$choice2~0_126, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_279} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite36, ~b$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, P2Thread1of1ForFork0_#t~ite35, P2Thread1of1ForFork0_#t~ite34, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 21:50:43,409 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L813-->L817: Formula: (and (= v_~b$flush_delayed~0_6 0) (not (= (mod v_~b$flush_delayed~0_7 256) 0)) (= v_~b~0_16 v_~b$mem_tmp~0_4)) InVars {~b$mem_tmp~0=v_~b$mem_tmp~0_4, ~b$flush_delayed~0=v_~b$flush_delayed~0_7} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_5|, ~b$mem_tmp~0=v_~b$mem_tmp~0_4, ~b~0=v_~b~0_16, ~b$flush_delayed~0=v_~b$flush_delayed~0_6} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~b~0, ~b$flush_delayed~0] because there is no mapped edge [2019-12-07 21:50:43,410 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L817-2-->L817-5: Formula: (let ((.cse2 (= (mod ~b$r_buff1_thd3~0_In-478784908 256) 0)) (.cse0 (= 0 (mod ~b$w_buff1_used~0_In-478784908 256))) (.cse1 (= |P2Thread1of1ForFork0_#t~ite39_Out-478784908| |P2Thread1of1ForFork0_#t~ite38_Out-478784908|))) (or (and (not .cse0) (= ~b$w_buff1~0_In-478784908 |P2Thread1of1ForFork0_#t~ite38_Out-478784908|) .cse1 (not .cse2)) (and (or .cse2 .cse0) .cse1 (= ~b~0_In-478784908 |P2Thread1of1ForFork0_#t~ite38_Out-478784908|)))) InVars {~b$w_buff1_used~0=~b$w_buff1_used~0_In-478784908, ~b~0=~b~0_In-478784908, ~b$w_buff1~0=~b$w_buff1~0_In-478784908, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-478784908} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out-478784908|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-478784908|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-478784908, ~b~0=~b~0_In-478784908, ~b$w_buff1~0=~b$w_buff1~0_In-478784908, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-478784908} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-07 21:50:43,410 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L818-->L818-2: Formula: (let ((.cse0 (= (mod ~b$w_buff0_used~0_In426257613 256) 0)) (.cse1 (= (mod ~b$r_buff0_thd3~0_In426257613 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out426257613| 0)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out426257613| ~b$w_buff0_used~0_In426257613)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In426257613, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In426257613} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In426257613, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In426257613, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out426257613|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-07 21:50:43,410 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L819-->L819-2: Formula: (let ((.cse2 (= (mod ~b$w_buff1_used~0_In1401693918 256) 0)) (.cse3 (= (mod ~b$r_buff1_thd3~0_In1401693918 256) 0)) (.cse1 (= 0 (mod ~b$r_buff0_thd3~0_In1401693918 256))) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In1401693918 256)))) (or (and (= ~b$w_buff1_used~0_In1401693918 |P2Thread1of1ForFork0_#t~ite41_Out1401693918|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork0_#t~ite41_Out1401693918|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1401693918, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1401693918, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1401693918, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In1401693918} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1401693918, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1401693918, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1401693918, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out1401693918|, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In1401693918} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-07 21:50:43,411 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L820-->L820-2: Formula: (let ((.cse1 (= 0 (mod ~b$w_buff0_used~0_In-1933865829 256))) (.cse0 (= 0 (mod ~b$r_buff0_thd3~0_In-1933865829 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out-1933865829| 0)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out-1933865829| ~b$r_buff0_thd3~0_In-1933865829) (or .cse1 .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1933865829, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1933865829} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1933865829, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1933865829, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-1933865829|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 21:50:43,411 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L821-->L821-2: Formula: (let ((.cse2 (= 0 (mod ~b$r_buff1_thd3~0_In262755449 256))) (.cse3 (= (mod ~b$w_buff1_used~0_In262755449 256) 0)) (.cse1 (= (mod ~b$w_buff0_used~0_In262755449 256) 0)) (.cse0 (= (mod ~b$r_buff0_thd3~0_In262755449 256) 0))) (or (and (= ~b$r_buff1_thd3~0_In262755449 |P2Thread1of1ForFork0_#t~ite43_Out262755449|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite43_Out262755449|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In262755449, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In262755449, ~b$w_buff1_used~0=~b$w_buff1_used~0_In262755449, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In262755449} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In262755449, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In262755449, P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out262755449|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In262755449, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In262755449} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-07 21:50:43,411 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L821-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0) (= |v_P2Thread1of1ForFork0_#t~ite43_34| v_~b$r_buff1_thd3~0_101)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_101, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~__unbuffered_cnt~0, ~b$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 21:50:43,412 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L780-->L780-2: Formula: (let ((.cse2 (= (mod ~b$w_buff1_used~0_In-550721285 256) 0)) (.cse3 (= (mod ~b$r_buff1_thd2~0_In-550721285 256) 0)) (.cse1 (= 0 (mod ~b$w_buff0_used~0_In-550721285 256))) (.cse0 (= (mod ~b$r_buff0_thd2~0_In-550721285 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite12_Out-550721285| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~b$w_buff1_used~0_In-550721285 |P1Thread1of1ForFork2_#t~ite12_Out-550721285|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-550721285, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-550721285, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-550721285, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-550721285} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-550721285, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-550721285, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-550721285, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-550721285|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-550721285} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-07 21:50:43,412 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L781-->L781-2: Formula: (let ((.cse1 (= 0 (mod ~b$r_buff0_thd2~0_In1162988879 256))) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In1162988879 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out1162988879|) (not .cse1)) (and (or .cse1 .cse0) (= ~b$r_buff0_thd2~0_In1162988879 |P1Thread1of1ForFork2_#t~ite13_Out1162988879|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1162988879, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1162988879} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1162988879, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1162988879, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out1162988879|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-07 21:50:43,412 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L782-->L782-2: Formula: (let ((.cse3 (= 0 (mod ~b$r_buff0_thd2~0_In1777596281 256))) (.cse2 (= 0 (mod ~b$w_buff0_used~0_In1777596281 256))) (.cse1 (= 0 (mod ~b$w_buff1_used~0_In1777596281 256))) (.cse0 (= 0 (mod ~b$r_buff1_thd2~0_In1777596281 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite14_Out1777596281| ~b$r_buff1_thd2~0_In1777596281) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork2_#t~ite14_Out1777596281| 0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1777596281, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1777596281, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1777596281, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In1777596281} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1777596281, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1777596281, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1777596281, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out1777596281|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In1777596281} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 21:50:43,413 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L782-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= v_~b$r_buff1_thd2~0_91 |v_P1Thread1of1ForFork2_#t~ite14_50|) (= (+ v_~__unbuffered_cnt~0_81 1) v_~__unbuffered_cnt~0_80)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_81, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_50|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_49|, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_91, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, ~b$r_buff1_thd2~0, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-07 21:50:43,413 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L848-->L850-2: Formula: (and (or (= 0 (mod v_~b$w_buff0_used~0_159 256)) (= 0 (mod v_~b$r_buff0_thd0~0_23 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_159, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_23} OutVars{~b$w_buff0_used~0=v_~b$w_buff0_used~0_159, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_23} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 21:50:43,413 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L850-2-->L850-4: Formula: (let ((.cse1 (= 0 (mod ~b$r_buff1_thd0~0_In1379683829 256))) (.cse0 (= (mod ~b$w_buff1_used~0_In1379683829 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out1379683829| ~b~0_In1379683829) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite47_Out1379683829| ~b$w_buff1~0_In1379683829) (not .cse0)))) InVars {~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In1379683829, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1379683829, ~b~0=~b~0_In1379683829, ~b$w_buff1~0=~b$w_buff1~0_In1379683829} OutVars{~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In1379683829, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1379683829, ~b~0=~b~0_In1379683829, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1379683829|, ~b$w_buff1~0=~b$w_buff1~0_In1379683829} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-07 21:50:43,413 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L850-4-->L851: Formula: (= v_~b~0_28 |v_ULTIMATE.start_main_#t~ite47_9|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_9|} OutVars{~b~0=v_~b~0_28, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_8|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_12|} AuxVars[] AssignedVars[~b~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-07 21:50:43,413 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L851-->L851-2: Formula: (let ((.cse1 (= 0 (mod ~b$w_buff0_used~0_In-503054881 256))) (.cse0 (= 0 (mod ~b$r_buff0_thd0~0_In-503054881 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite49_Out-503054881|) (not .cse1)) (and (or .cse1 .cse0) (= ~b$w_buff0_used~0_In-503054881 |ULTIMATE.start_main_#t~ite49_Out-503054881|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-503054881, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-503054881} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-503054881, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-503054881|, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-503054881} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-07 21:50:43,414 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L852-->L852-2: Formula: (let ((.cse2 (= (mod ~b$w_buff0_used~0_In544716352 256) 0)) (.cse3 (= 0 (mod ~b$r_buff0_thd0~0_In544716352 256))) (.cse0 (= (mod ~b$w_buff1_used~0_In544716352 256) 0)) (.cse1 (= (mod ~b$r_buff1_thd0~0_In544716352 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite50_Out544716352| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite50_Out544716352| ~b$w_buff1_used~0_In544716352) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In544716352, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In544716352, ~b$w_buff1_used~0=~b$w_buff1_used~0_In544716352, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In544716352} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out544716352|, ~b$w_buff0_used~0=~b$w_buff0_used~0_In544716352, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In544716352, ~b$w_buff1_used~0=~b$w_buff1_used~0_In544716352, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In544716352} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-07 21:50:43,414 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L853-->L853-2: Formula: (let ((.cse0 (= (mod ~b$w_buff0_used~0_In76164877 256) 0)) (.cse1 (= (mod ~b$r_buff0_thd0~0_In76164877 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out76164877| 0)) (and (or .cse0 .cse1) (= ~b$r_buff0_thd0~0_In76164877 |ULTIMATE.start_main_#t~ite51_Out76164877|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In76164877, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In76164877} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In76164877, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out76164877|, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In76164877} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-07 21:50:43,414 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L854-->L854-2: Formula: (let ((.cse3 (= 0 (mod ~b$r_buff0_thd0~0_In-2119238586 256))) (.cse2 (= 0 (mod ~b$w_buff0_used~0_In-2119238586 256))) (.cse1 (= (mod ~b$r_buff1_thd0~0_In-2119238586 256) 0)) (.cse0 (= 0 (mod ~b$w_buff1_used~0_In-2119238586 256)))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out-2119238586| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite52_Out-2119238586| ~b$r_buff1_thd0~0_In-2119238586) (or .cse1 .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-2119238586, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-2119238586, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-2119238586, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-2119238586} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-2119238586, ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-2119238586|, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-2119238586, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-2119238586, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-2119238586} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-07 21:50:43,414 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] L854-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|) (= v_~main$tmp_guard1~0_17 (ite (= 0 (ite (not (and (= 1 v_~__unbuffered_p1_EAX~0_30) (= v_~__unbuffered_p2_EBX~0_21 0) (= v_~x~0_96 2) (= v_~__unbuffered_p1_EBX~0_30 0) (= 1 v_~__unbuffered_p2_EAX~0_23))) 1 0)) 0 1)) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0) (= v_~b$r_buff1_thd0~0_116 |v_ULTIMATE.start_main_#t~ite52_39|)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_39|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_30, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_21, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_30, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_96} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_30, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_21, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_116, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_30, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_96, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~b$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 21:50:43,466 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_5babf723-e4d1-4621-9de4-70e5e2e1ba68/bin/utaipan/witness.graphml [2019-12-07 21:50:43,466 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 21:50:43,467 INFO L168 Benchmark]: Toolchain (without parser) took 208254.78 ms. Allocated memory was 1.0 GB in the beginning and 8.1 GB in the end (delta: 7.1 GB). Free memory was 943.5 MB in the beginning and 6.9 GB in the end (delta: -6.0 GB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-12-07 21:50:43,467 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:50:43,467 INFO L168 Benchmark]: CACSL2BoogieTranslator took 382.09 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.8 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -122.6 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-12-07 21:50:43,467 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.56 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 21:50:43,468 INFO L168 Benchmark]: Boogie Preprocessor took 26.86 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 21:50:43,468 INFO L168 Benchmark]: RCFGBuilder took 417.81 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 62.1 MB). Peak memory consumption was 62.1 MB. Max. memory is 11.5 GB. [2019-12-07 21:50:43,468 INFO L168 Benchmark]: TraceAbstraction took 207319.46 ms. Allocated memory was 1.1 GB in the beginning and 8.1 GB in the end (delta: 7.0 GB). Free memory was 1.0 GB in the beginning and 7.0 GB in the end (delta: -6.0 GB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2019-12-07 21:50:43,468 INFO L168 Benchmark]: Witness Printer took 66.63 ms. Allocated memory is still 8.1 GB. Free memory was 7.0 GB in the beginning and 6.9 GB in the end (delta: 51.1 MB). Peak memory consumption was 51.1 MB. Max. memory is 11.5 GB. [2019-12-07 21:50:43,470 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 382.09 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 103.8 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -122.6 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.56 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 26.86 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. * RCFGBuilder took 417.81 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 62.1 MB). Peak memory consumption was 62.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 207319.46 ms. Allocated memory was 1.1 GB in the beginning and 8.1 GB in the end (delta: 7.0 GB). Free memory was 1.0 GB in the beginning and 7.0 GB in the end (delta: -6.0 GB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. * Witness Printer took 66.63 ms. Allocated memory is still 8.1 GB. Free memory was 7.0 GB in the beginning and 6.9 GB in the end (delta: 51.1 MB). Peak memory consumption was 51.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.4s, 179 ProgramPointsBefore, 93 ProgramPointsAfterwards, 216 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 32 ChoiceCompositions, 7364 VarBasedMoverChecksPositive, 244 VarBasedMoverChecksNegative, 47 SemBasedMoverChecksPositive, 271 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.0s, 0 MoverChecksTotal, 80691 CheckedPairsTotal, 120 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L840] FCALL, FORK 0 pthread_create(&t873, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L842] FCALL, FORK 0 pthread_create(&t874, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L737] 1 b$w_buff1 = b$w_buff0 [L738] 1 b$w_buff0 = 1 [L739] 1 b$w_buff1_used = b$w_buff0_used [L740] 1 b$w_buff0_used = (_Bool)1 [L752] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L766] 2 x = 2 [L769] 2 y = 1 [L772] 2 __unbuffered_p1_EAX = y [L775] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L778] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L752] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L778] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L753] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L754] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L844] FCALL, FORK 0 pthread_create(&t875, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L792] 3 z = 1 [L795] 3 a = 1 [L798] 3 __unbuffered_p2_EAX = a [L801] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L802] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L803] 3 b$flush_delayed = weak$$choice2 [L804] 3 b$mem_tmp = b VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, z=1] [L805] EXPR 3 !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) VAL [!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, z=1] [L805] 3 b = !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) [L806] EXPR 3 weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0))=1, x=2, y=1, z=1] [L806] 3 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0)) [L807] EXPR 3 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1))=0, x=2, y=1, z=1] [L807] 3 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) [L808] EXPR 3 weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used))=0, x=2, y=1, z=1] [L808] 3 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used)) [L809] 3 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L811] 3 b$r_buff1_thd3 = weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L812] 3 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, z=1] [L817] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, z=1] [L817] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L818] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L819] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L820] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L779] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L780] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L781] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L846] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, z=1] [L851] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L852] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L853] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 170 locations, 2 error locations. Result: UNSAFE, OverallTime: 207.1s, OverallIterations: 39, TraceHistogramMax: 1, AutomataDifference: 46.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9092 SDtfs, 9730 SDslu, 23888 SDs, 0 SdLazy, 14857 SolverSat, 386 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 385 GetRequests, 66 SyntacticMatches, 20 SemanticMatches, 299 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 978 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=349791occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 140.9s AutomataMinimizationTime, 38 MinimizatonAttempts, 595463 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1490 NumberOfCodeBlocks, 1490 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 1386 ConstructedInterpolants, 0 QuantifiedInterpolants, 418006 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 38 InterpolantComputations, 38 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...