./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix009_pso.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_e5fe3c23-61f4-4365-a415-6ca3c8496b2c/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e5fe3c23-61f4-4365-a415-6ca3c8496b2c/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e5fe3c23-61f4-4365-a415-6ca3c8496b2c/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e5fe3c23-61f4-4365-a415-6ca3c8496b2c/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix009_pso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_e5fe3c23-61f4-4365-a415-6ca3c8496b2c/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e5fe3c23-61f4-4365-a415-6ca3c8496b2c/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 63452b000fd1c51474a71b6cfd9415a028dcdf38 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 13:17:37,492 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 13:17:37,493 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 13:17:37,501 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 13:17:37,501 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 13:17:37,501 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 13:17:37,502 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 13:17:37,504 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 13:17:37,505 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 13:17:37,506 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 13:17:37,506 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 13:17:37,507 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 13:17:37,507 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 13:17:37,508 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 13:17:37,508 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 13:17:37,509 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 13:17:37,510 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 13:17:37,510 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 13:17:37,512 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 13:17:37,514 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 13:17:37,515 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 13:17:37,516 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 13:17:37,516 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 13:17:37,517 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 13:17:37,519 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 13:17:37,519 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 13:17:37,519 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 13:17:37,519 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 13:17:37,520 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 13:17:37,520 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 13:17:37,520 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 13:17:37,521 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 13:17:37,521 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 13:17:37,522 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 13:17:37,522 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 13:17:37,522 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 13:17:37,523 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 13:17:37,523 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 13:17:37,523 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 13:17:37,523 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 13:17:37,524 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 13:17:37,524 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e5fe3c23-61f4-4365-a415-6ca3c8496b2c/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 13:17:37,534 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 13:17:37,534 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 13:17:37,534 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 13:17:37,535 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 13:17:37,535 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 13:17:37,535 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 13:17:37,535 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 13:17:37,535 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 13:17:37,535 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 13:17:37,535 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 13:17:37,535 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 13:17:37,535 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 13:17:37,536 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 13:17:37,536 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 13:17:37,536 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 13:17:37,536 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 13:17:37,536 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 13:17:37,536 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 13:17:37,536 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 13:17:37,537 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 13:17:37,537 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 13:17:37,537 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 13:17:37,537 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 13:17:37,537 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 13:17:37,537 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 13:17:37,537 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 13:17:37,537 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 13:17:37,537 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 13:17:37,538 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 13:17:37,538 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 13:17:37,538 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 13:17:37,538 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:17:37,538 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 13:17:37,538 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 13:17:37,538 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 13:17:37,539 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 13:17:37,539 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 13:17:37,539 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 13:17:37,539 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 13:17:37,539 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 13:17:37,539 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_e5fe3c23-61f4-4365-a415-6ca3c8496b2c/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 -> 63452b000fd1c51474a71b6cfd9415a028dcdf38 [2019-12-07 13:17:37,643 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 13:17:37,653 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 13:17:37,656 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 13:17:37,657 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 13:17:37,658 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 13:17:37,658 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e5fe3c23-61f4-4365-a415-6ca3c8496b2c/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix009_pso.oepc.i [2019-12-07 13:17:37,698 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e5fe3c23-61f4-4365-a415-6ca3c8496b2c/bin/utaipan/data/21cde4b01/6eb39ce73de148ac96224c9ef8d32fe6/FLAG7de517aa3 [2019-12-07 13:17:38,133 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 13:17:38,134 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e5fe3c23-61f4-4365-a415-6ca3c8496b2c/sv-benchmarks/c/pthread-wmm/mix009_pso.oepc.i [2019-12-07 13:17:38,144 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e5fe3c23-61f4-4365-a415-6ca3c8496b2c/bin/utaipan/data/21cde4b01/6eb39ce73de148ac96224c9ef8d32fe6/FLAG7de517aa3 [2019-12-07 13:17:38,153 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e5fe3c23-61f4-4365-a415-6ca3c8496b2c/bin/utaipan/data/21cde4b01/6eb39ce73de148ac96224c9ef8d32fe6 [2019-12-07 13:17:38,155 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 13:17:38,156 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 13:17:38,157 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 13:17:38,157 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 13:17:38,159 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 13:17:38,160 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:17:38" (1/1) ... [2019-12-07 13:17:38,161 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@355b5b5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:17:38, skipping insertion in model container [2019-12-07 13:17:38,162 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:17:38" (1/1) ... [2019-12-07 13:17:38,166 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 13:17:38,196 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 13:17:38,436 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:17:38,444 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 13:17:38,486 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:17:38,532 INFO L208 MainTranslator]: Completed translation [2019-12-07 13:17:38,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:17:38 WrapperNode [2019-12-07 13:17:38,532 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 13:17:38,533 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 13:17:38,533 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 13:17:38,533 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 13:17:38,538 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:17:38" (1/1) ... [2019-12-07 13:17:38,551 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:17:38" (1/1) ... [2019-12-07 13:17:38,570 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 13:17:38,570 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 13:17:38,570 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 13:17:38,570 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 13:17:38,577 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:17:38" (1/1) ... [2019-12-07 13:17:38,577 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:17:38" (1/1) ... [2019-12-07 13:17:38,580 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:17:38" (1/1) ... [2019-12-07 13:17:38,580 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:17:38" (1/1) ... [2019-12-07 13:17:38,586 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:17:38" (1/1) ... [2019-12-07 13:17:38,589 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:17:38" (1/1) ... [2019-12-07 13:17:38,591 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:17:38" (1/1) ... [2019-12-07 13:17:38,594 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 13:17:38,595 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 13:17:38,595 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 13:17:38,595 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 13:17:38,595 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:17:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e5fe3c23-61f4-4365-a415-6ca3c8496b2c/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 13:17:38,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 13:17:38,638 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 13:17:38,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 13:17:38,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 13:17:38,638 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 13:17:38,638 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 13:17:38,638 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 13:17:38,638 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 13:17:38,638 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 13:17:38,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 13:17:38,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 13:17:38,640 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 13:17:38,980 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 13:17:38,980 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 13:17:38,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:17:38 BoogieIcfgContainer [2019-12-07 13:17:38,981 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 13:17:38,981 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 13:17:38,981 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 13:17:38,983 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 13:17:38,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:17:38" (1/3) ... [2019-12-07 13:17:38,984 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5000e0a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:17:38, skipping insertion in model container [2019-12-07 13:17:38,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:17:38" (2/3) ... [2019-12-07 13:17:38,984 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5000e0a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:17:38, skipping insertion in model container [2019-12-07 13:17:38,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:17:38" (3/3) ... [2019-12-07 13:17:38,985 INFO L109 eAbstractionObserver]: Analyzing ICFG mix009_pso.oepc.i [2019-12-07 13:17:38,991 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 13:17:38,991 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 13:17:38,996 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 13:17:38,996 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 13:17:39,018 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,019 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,019 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,019 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,019 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,019 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,019 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,020 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,021 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,022 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,023 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,024 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,025 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,025 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,025 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,026 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,027 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,029 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,030 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,031 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,032 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,033 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,034 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,035 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,036 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:17:39,049 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 13:17:39,062 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 13:17:39,062 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 13:17:39,062 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 13:17:39,062 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 13:17:39,062 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 13:17:39,062 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 13:17:39,062 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 13:17:39,062 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 13:17:39,073 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 184 transitions [2019-12-07 13:17:39,074 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 150 places, 184 transitions [2019-12-07 13:17:39,122 INFO L134 PetriNetUnfolder]: 41/182 cut-off events. [2019-12-07 13:17:39,122 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 13:17:39,130 INFO L76 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 182 events. 41/182 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 559 event pairs. 6/145 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 13:17:39,141 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 150 places, 184 transitions [2019-12-07 13:17:39,167 INFO L134 PetriNetUnfolder]: 41/182 cut-off events. [2019-12-07 13:17:39,167 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 13:17:39,171 INFO L76 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 182 events. 41/182 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 559 event pairs. 6/145 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 13:17:39,182 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-07 13:17:39,183 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 13:17:42,196 WARN L192 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-07 13:17:42,304 INFO L206 etLargeBlockEncoding]: Checked pairs total: 54623 [2019-12-07 13:17:42,304 INFO L214 etLargeBlockEncoding]: Total number of compositions: 105 [2019-12-07 13:17:42,307 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 88 transitions [2019-12-07 13:17:42,645 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8640 states. [2019-12-07 13:17:42,647 INFO L276 IsEmpty]: Start isEmpty. Operand 8640 states. [2019-12-07 13:17:42,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 13:17:42,651 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:17:42,651 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 13:17:42,652 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:17:42,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:42,655 INFO L82 PathProgramCache]: Analyzing trace with hash 798193, now seen corresponding path program 1 times [2019-12-07 13:17:42,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:17:42,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415692636] [2019-12-07 13:17:42,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:42,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:17:42,787 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 13:17:42,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415692636] [2019-12-07 13:17:42,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:17:42,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 13:17:42,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879206408] [2019-12-07 13:17:42,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:17:42,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:17:42,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:17:42,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:17:42,803 INFO L87 Difference]: Start difference. First operand 8640 states. Second operand 3 states. [2019-12-07 13:17:42,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:17:42,979 INFO L93 Difference]: Finished difference Result 8466 states and 27782 transitions. [2019-12-07 13:17:42,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:17:42,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 13:17:42,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:17:43,041 INFO L225 Difference]: With dead ends: 8466 [2019-12-07 13:17:43,041 INFO L226 Difference]: Without dead ends: 7974 [2019-12-07 13:17:43,042 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 13:17:43,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7974 states. [2019-12-07 13:17:43,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7974 to 7974. [2019-12-07 13:17:43,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7974 states. [2019-12-07 13:17:43,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7974 states to 7974 states and 26121 transitions. [2019-12-07 13:17:43,315 INFO L78 Accepts]: Start accepts. Automaton has 7974 states and 26121 transitions. Word has length 3 [2019-12-07 13:17:43,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:17:43,316 INFO L462 AbstractCegarLoop]: Abstraction has 7974 states and 26121 transitions. [2019-12-07 13:17:43,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:17:43,316 INFO L276 IsEmpty]: Start isEmpty. Operand 7974 states and 26121 transitions. [2019-12-07 13:17:43,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 13:17:43,319 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:17:43,319 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:17:43,319 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:17:43,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:43,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1209832272, now seen corresponding path program 1 times [2019-12-07 13:17:43,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:17:43,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926835506] [2019-12-07 13:17:43,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:43,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:17:43,379 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 13:17:43,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926835506] [2019-12-07 13:17:43,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:17:43,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:17:43,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746160334] [2019-12-07 13:17:43,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:17:43,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:17:43,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:17:43,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:17:43,381 INFO L87 Difference]: Start difference. First operand 7974 states and 26121 transitions. Second operand 4 states. [2019-12-07 13:17:43,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:17:43,633 INFO L93 Difference]: Finished difference Result 12158 states and 38103 transitions. [2019-12-07 13:17:43,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:17:43,633 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 13:17:43,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:17:43,686 INFO L225 Difference]: With dead ends: 12158 [2019-12-07 13:17:43,686 INFO L226 Difference]: Without dead ends: 12151 [2019-12-07 13:17:43,686 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 13:17:43,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12151 states. [2019-12-07 13:17:43,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12151 to 10962. [2019-12-07 13:17:43,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10962 states. [2019-12-07 13:17:43,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10962 states to 10962 states and 34971 transitions. [2019-12-07 13:17:43,996 INFO L78 Accepts]: Start accepts. Automaton has 10962 states and 34971 transitions. Word has length 11 [2019-12-07 13:17:43,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:17:43,997 INFO L462 AbstractCegarLoop]: Abstraction has 10962 states and 34971 transitions. [2019-12-07 13:17:43,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:17:43,997 INFO L276 IsEmpty]: Start isEmpty. Operand 10962 states and 34971 transitions. [2019-12-07 13:17:44,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 13:17:44,001 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:17:44,001 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:17:44,001 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:17:44,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:44,002 INFO L82 PathProgramCache]: Analyzing trace with hash 768793875, now seen corresponding path program 1 times [2019-12-07 13:17:44,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:17:44,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485071345] [2019-12-07 13:17:44,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:44,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:17:44,057 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 13:17:44,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485071345] [2019-12-07 13:17:44,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:17:44,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:17:44,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991455206] [2019-12-07 13:17:44,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:17:44,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:17:44,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:17:44,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:17:44,058 INFO L87 Difference]: Start difference. First operand 10962 states and 34971 transitions. Second operand 5 states. [2019-12-07 13:17:44,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:17:44,308 INFO L93 Difference]: Finished difference Result 15393 states and 48301 transitions. [2019-12-07 13:17:44,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 13:17:44,309 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 13:17:44,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:17:44,339 INFO L225 Difference]: With dead ends: 15393 [2019-12-07 13:17:44,339 INFO L226 Difference]: Without dead ends: 15393 [2019-12-07 13:17:44,340 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 13:17:44,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15393 states. [2019-12-07 13:17:44,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15393 to 12374. [2019-12-07 13:17:44,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12374 states. [2019-12-07 13:17:44,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12374 states to 12374 states and 39394 transitions. [2019-12-07 13:17:44,581 INFO L78 Accepts]: Start accepts. Automaton has 12374 states and 39394 transitions. Word has length 14 [2019-12-07 13:17:44,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:17:44,582 INFO L462 AbstractCegarLoop]: Abstraction has 12374 states and 39394 transitions. [2019-12-07 13:17:44,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:17:44,582 INFO L276 IsEmpty]: Start isEmpty. Operand 12374 states and 39394 transitions. [2019-12-07 13:17:44,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 13:17:44,585 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:17:44,585 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:17:44,585 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:17:44,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:44,585 INFO L82 PathProgramCache]: Analyzing trace with hash 484931163, now seen corresponding path program 1 times [2019-12-07 13:17:44,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:17:44,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794482572] [2019-12-07 13:17:44,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:44,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:17:44,645 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 13:17:44,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794482572] [2019-12-07 13:17:44,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:17:44,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:17:44,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854796927] [2019-12-07 13:17:44,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:17:44,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:17:44,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:17:44,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:17:44,646 INFO L87 Difference]: Start difference. First operand 12374 states and 39394 transitions. Second operand 3 states. [2019-12-07 13:17:44,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:17:44,682 INFO L93 Difference]: Finished difference Result 11716 states and 36735 transitions. [2019-12-07 13:17:44,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:17:44,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 13:17:44,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:17:44,701 INFO L225 Difference]: With dead ends: 11716 [2019-12-07 13:17:44,701 INFO L226 Difference]: Without dead ends: 11716 [2019-12-07 13:17:44,701 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 13:17:44,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11716 states. [2019-12-07 13:17:44,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11716 to 11636. [2019-12-07 13:17:44,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11636 states. [2019-12-07 13:17:44,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11636 states to 11636 states and 36503 transitions. [2019-12-07 13:17:44,921 INFO L78 Accepts]: Start accepts. Automaton has 11636 states and 36503 transitions. Word has length 16 [2019-12-07 13:17:44,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:17:44,921 INFO L462 AbstractCegarLoop]: Abstraction has 11636 states and 36503 transitions. [2019-12-07 13:17:44,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:17:44,922 INFO L276 IsEmpty]: Start isEmpty. Operand 11636 states and 36503 transitions. [2019-12-07 13:17:44,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 13:17:44,924 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:17:44,924 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:17:44,924 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:17:44,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:44,924 INFO L82 PathProgramCache]: Analyzing trace with hash 465765166, now seen corresponding path program 1 times [2019-12-07 13:17:44,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:17:44,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105055734] [2019-12-07 13:17:44,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:44,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:17:44,987 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 13:17:44,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105055734] [2019-12-07 13:17:44,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:17:44,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 13:17:44,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898667494] [2019-12-07 13:17:44,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:17:44,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:17:44,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:17:44,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:17:44,989 INFO L87 Difference]: Start difference. First operand 11636 states and 36503 transitions. Second operand 3 states. [2019-12-07 13:17:45,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:17:45,024 INFO L93 Difference]: Finished difference Result 11698 states and 36598 transitions. [2019-12-07 13:17:45,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:17:45,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 13:17:45,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:17:45,043 INFO L225 Difference]: With dead ends: 11698 [2019-12-07 13:17:45,043 INFO L226 Difference]: Without dead ends: 11698 [2019-12-07 13:17:45,044 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 13:17:45,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11698 states. [2019-12-07 13:17:45,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11698 to 11633. [2019-12-07 13:17:45,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11633 states. [2019-12-07 13:17:45,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11633 states to 11633 states and 36494 transitions. [2019-12-07 13:17:45,247 INFO L78 Accepts]: Start accepts. Automaton has 11633 states and 36494 transitions. Word has length 16 [2019-12-07 13:17:45,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:17:45,247 INFO L462 AbstractCegarLoop]: Abstraction has 11633 states and 36494 transitions. [2019-12-07 13:17:45,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:17:45,247 INFO L276 IsEmpty]: Start isEmpty. Operand 11633 states and 36494 transitions. [2019-12-07 13:17:45,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 13:17:45,250 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:17:45,250 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:17:45,250 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:17:45,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:45,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1868214612, now seen corresponding path program 1 times [2019-12-07 13:17:45,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:17:45,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509104964] [2019-12-07 13:17:45,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:45,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:17:45,306 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 13:17:45,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509104964] [2019-12-07 13:17:45,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:17:45,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:17:45,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270466313] [2019-12-07 13:17:45,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:17:45,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:17:45,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:17:45,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:17:45,308 INFO L87 Difference]: Start difference. First operand 11633 states and 36494 transitions. Second operand 4 states. [2019-12-07 13:17:45,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:17:45,346 INFO L93 Difference]: Finished difference Result 11465 states and 35956 transitions. [2019-12-07 13:17:45,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:17:45,347 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-07 13:17:45,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:17:45,361 INFO L225 Difference]: With dead ends: 11465 [2019-12-07 13:17:45,361 INFO L226 Difference]: Without dead ends: 11465 [2019-12-07 13:17:45,361 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 13:17:45,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11465 states. [2019-12-07 13:17:45,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11465 to 11465. [2019-12-07 13:17:45,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11465 states. [2019-12-07 13:17:45,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11465 states to 11465 states and 35956 transitions. [2019-12-07 13:17:45,530 INFO L78 Accepts]: Start accepts. Automaton has 11465 states and 35956 transitions. Word has length 17 [2019-12-07 13:17:45,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:17:45,530 INFO L462 AbstractCegarLoop]: Abstraction has 11465 states and 35956 transitions. [2019-12-07 13:17:45,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:17:45,530 INFO L276 IsEmpty]: Start isEmpty. Operand 11465 states and 35956 transitions. [2019-12-07 13:17:45,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 13:17:45,533 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:17:45,533 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 13:17:45,533 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:17:45,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:45,533 INFO L82 PathProgramCache]: Analyzing trace with hash -715570933, now seen corresponding path program 1 times [2019-12-07 13:17:45,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:17:45,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399849519] [2019-12-07 13:17:45,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:45,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:17:45,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:17:45,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399849519] [2019-12-07 13:17:45,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:17:45,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:17:45,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350176398] [2019-12-07 13:17:45,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:17:45,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:17:45,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:17:45,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:17:45,589 INFO L87 Difference]: Start difference. First operand 11465 states and 35956 transitions. Second operand 4 states. [2019-12-07 13:17:45,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:17:45,630 INFO L93 Difference]: Finished difference Result 11508 states and 35995 transitions. [2019-12-07 13:17:45,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:17:45,631 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 13:17:45,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:17:45,644 INFO L225 Difference]: With dead ends: 11508 [2019-12-07 13:17:45,645 INFO L226 Difference]: Without dead ends: 11508 [2019-12-07 13:17:45,645 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 13:17:45,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11508 states. [2019-12-07 13:17:45,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11508 to 11443. [2019-12-07 13:17:45,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11443 states. [2019-12-07 13:17:45,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11443 states to 11443 states and 35891 transitions. [2019-12-07 13:17:45,818 INFO L78 Accepts]: Start accepts. Automaton has 11443 states and 35891 transitions. Word has length 18 [2019-12-07 13:17:45,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:17:45,819 INFO L462 AbstractCegarLoop]: Abstraction has 11443 states and 35891 transitions. [2019-12-07 13:17:45,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:17:45,819 INFO L276 IsEmpty]: Start isEmpty. Operand 11443 states and 35891 transitions. [2019-12-07 13:17:45,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 13:17:45,823 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:17:45,823 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 13:17:45,823 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:17:45,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:45,823 INFO L82 PathProgramCache]: Analyzing trace with hash -393466089, now seen corresponding path program 1 times [2019-12-07 13:17:45,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:17:45,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125095060] [2019-12-07 13:17:45,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:45,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:17:45,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:17:45,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125095060] [2019-12-07 13:17:45,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:17:45,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:17:45,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206494077] [2019-12-07 13:17:45,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:17:45,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:17:45,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:17:45,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:17:45,859 INFO L87 Difference]: Start difference. First operand 11443 states and 35891 transitions. Second operand 3 states. [2019-12-07 13:17:45,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:17:45,870 INFO L93 Difference]: Finished difference Result 1506 states and 3373 transitions. [2019-12-07 13:17:45,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:17:45,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 13:17:45,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:17:45,872 INFO L225 Difference]: With dead ends: 1506 [2019-12-07 13:17:45,872 INFO L226 Difference]: Without dead ends: 1506 [2019-12-07 13:17:45,873 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 13:17:45,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2019-12-07 13:17:45,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1506. [2019-12-07 13:17:45,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1506 states. [2019-12-07 13:17:45,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 3373 transitions. [2019-12-07 13:17:45,891 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 3373 transitions. Word has length 19 [2019-12-07 13:17:45,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:17:45,891 INFO L462 AbstractCegarLoop]: Abstraction has 1506 states and 3373 transitions. [2019-12-07 13:17:45,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:17:45,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 3373 transitions. [2019-12-07 13:17:45,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 13:17:45,892 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:17:45,892 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] [2019-12-07 13:17:45,892 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:17:45,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:45,893 INFO L82 PathProgramCache]: Analyzing trace with hash -845336479, now seen corresponding path program 1 times [2019-12-07 13:17:45,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:17:45,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106205266] [2019-12-07 13:17:45,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:45,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:17:45,948 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 13:17:45,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106205266] [2019-12-07 13:17:45,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:17:45,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:17:45,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498302031] [2019-12-07 13:17:45,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:17:45,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:17:45,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:17:45,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:17:45,950 INFO L87 Difference]: Start difference. First operand 1506 states and 3373 transitions. Second operand 6 states. [2019-12-07 13:17:46,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:17:46,228 INFO L93 Difference]: Finished difference Result 2289 states and 4911 transitions. [2019-12-07 13:17:46,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 13:17:46,229 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-07 13:17:46,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:17:46,230 INFO L225 Difference]: With dead ends: 2289 [2019-12-07 13:17:46,230 INFO L226 Difference]: Without dead ends: 2289 [2019-12-07 13:17:46,230 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 13:17:46,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2289 states. [2019-12-07 13:17:46,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2289 to 1520. [2019-12-07 13:17:46,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1520 states. [2019-12-07 13:17:46,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1520 states and 3402 transitions. [2019-12-07 13:17:46,244 INFO L78 Accepts]: Start accepts. Automaton has 1520 states and 3402 transitions. Word has length 25 [2019-12-07 13:17:46,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:17:46,244 INFO L462 AbstractCegarLoop]: Abstraction has 1520 states and 3402 transitions. [2019-12-07 13:17:46,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:17:46,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1520 states and 3402 transitions. [2019-12-07 13:17:46,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 13:17:46,246 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:17:46,246 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 13:17:46,246 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:17:46,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:46,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1337227567, now seen corresponding path program 1 times [2019-12-07 13:17:46,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:17:46,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61911319] [2019-12-07 13:17:46,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:46,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:17:46,286 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 13:17:46,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61911319] [2019-12-07 13:17:46,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:17:46,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:17:46,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367928271] [2019-12-07 13:17:46,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:17:46,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:17:46,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:17:46,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:17:46,287 INFO L87 Difference]: Start difference. First operand 1520 states and 3402 transitions. Second operand 4 states. [2019-12-07 13:17:46,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:17:46,297 INFO L93 Difference]: Finished difference Result 737 states and 1632 transitions. [2019-12-07 13:17:46,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:17:46,297 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-07 13:17:46,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:17:46,298 INFO L225 Difference]: With dead ends: 737 [2019-12-07 13:17:46,298 INFO L226 Difference]: Without dead ends: 737 [2019-12-07 13:17:46,299 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 13:17:46,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2019-12-07 13:17:46,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 737. [2019-12-07 13:17:46,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2019-12-07 13:17:46,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1632 transitions. [2019-12-07 13:17:46,305 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1632 transitions. Word has length 28 [2019-12-07 13:17:46,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:17:46,305 INFO L462 AbstractCegarLoop]: Abstraction has 737 states and 1632 transitions. [2019-12-07 13:17:46,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:17:46,305 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1632 transitions. [2019-12-07 13:17:46,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 13:17:46,307 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:17:46,307 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] [2019-12-07 13:17:46,307 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:17:46,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:46,307 INFO L82 PathProgramCache]: Analyzing trace with hash 299597665, now seen corresponding path program 1 times [2019-12-07 13:17:46,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:17:46,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762658922] [2019-12-07 13:17:46,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:46,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:17:46,332 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 13:17:46,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762658922] [2019-12-07 13:17:46,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:17:46,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:17:46,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832552726] [2019-12-07 13:17:46,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:17:46,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:17:46,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:17:46,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:17:46,334 INFO L87 Difference]: Start difference. First operand 737 states and 1632 transitions. Second operand 3 states. [2019-12-07 13:17:46,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:17:46,365 INFO L93 Difference]: Finished difference Result 1125 states and 2413 transitions. [2019-12-07 13:17:46,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:17:46,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-07 13:17:46,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:17:46,367 INFO L225 Difference]: With dead ends: 1125 [2019-12-07 13:17:46,367 INFO L226 Difference]: Without dead ends: 1125 [2019-12-07 13:17:46,367 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 13:17:46,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2019-12-07 13:17:46,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 840. [2019-12-07 13:17:46,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2019-12-07 13:17:46,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1837 transitions. [2019-12-07 13:17:46,375 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1837 transitions. Word has length 52 [2019-12-07 13:17:46,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:17:46,375 INFO L462 AbstractCegarLoop]: Abstraction has 840 states and 1837 transitions. [2019-12-07 13:17:46,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:17:46,375 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1837 transitions. [2019-12-07 13:17:46,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 13:17:46,376 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:17:46,376 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] [2019-12-07 13:17:46,377 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:17:46,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:46,377 INFO L82 PathProgramCache]: Analyzing trace with hash -921868638, now seen corresponding path program 1 times [2019-12-07 13:17:46,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:17:46,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553903513] [2019-12-07 13:17:46,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:46,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:17:46,444 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 13:17:46,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553903513] [2019-12-07 13:17:46,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:17:46,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 13:17:46,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003347727] [2019-12-07 13:17:46,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:17:46,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:17:46,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:17:46,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:17:46,445 INFO L87 Difference]: Start difference. First operand 840 states and 1837 transitions. Second operand 7 states. [2019-12-07 13:17:46,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:17:46,875 INFO L93 Difference]: Finished difference Result 1572 states and 3311 transitions. [2019-12-07 13:17:46,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 13:17:46,876 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-07 13:17:46,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:17:46,877 INFO L225 Difference]: With dead ends: 1572 [2019-12-07 13:17:46,877 INFO L226 Difference]: Without dead ends: 1572 [2019-12-07 13:17:46,877 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-12-07 13:17:46,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2019-12-07 13:17:46,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1093. [2019-12-07 13:17:46,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1093 states. [2019-12-07 13:17:46,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1093 states to 1093 states and 2376 transitions. [2019-12-07 13:17:46,887 INFO L78 Accepts]: Start accepts. Automaton has 1093 states and 2376 transitions. Word has length 52 [2019-12-07 13:17:46,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:17:46,887 INFO L462 AbstractCegarLoop]: Abstraction has 1093 states and 2376 transitions. [2019-12-07 13:17:46,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:17:46,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1093 states and 2376 transitions. [2019-12-07 13:17:46,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 13:17:46,888 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:17:46,888 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] [2019-12-07 13:17:46,889 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:17:46,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:46,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1483615416, now seen corresponding path program 2 times [2019-12-07 13:17:46,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:17:46,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112849981] [2019-12-07 13:17:46,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:46,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:17:46,965 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 13:17:46,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112849981] [2019-12-07 13:17:46,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:17:46,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:17:46,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527577567] [2019-12-07 13:17:46,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:17:46,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:17:46,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:17:46,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:17:46,967 INFO L87 Difference]: Start difference. First operand 1093 states and 2376 transitions. Second operand 4 states. [2019-12-07 13:17:47,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:17:47,011 INFO L93 Difference]: Finished difference Result 1343 states and 2901 transitions. [2019-12-07 13:17:47,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:17:47,011 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-07 13:17:47,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:17:47,012 INFO L225 Difference]: With dead ends: 1343 [2019-12-07 13:17:47,012 INFO L226 Difference]: Without dead ends: 1343 [2019-12-07 13:17:47,012 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 2 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 13:17:47,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2019-12-07 13:17:47,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 997. [2019-12-07 13:17:47,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-12-07 13:17:47,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 2200 transitions. [2019-12-07 13:17:47,021 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 2200 transitions. Word has length 52 [2019-12-07 13:17:47,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:17:47,021 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 2200 transitions. [2019-12-07 13:17:47,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:17:47,022 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 2200 transitions. [2019-12-07 13:17:47,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 13:17:47,023 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:17:47,023 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] [2019-12-07 13:17:47,023 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:17:47,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:47,023 INFO L82 PathProgramCache]: Analyzing trace with hash 223383117, now seen corresponding path program 1 times [2019-12-07 13:17:47,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:17:47,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150585181] [2019-12-07 13:17:47,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:47,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:17:47,223 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 13:17:47,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150585181] [2019-12-07 13:17:47,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:17:47,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 13:17:47,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477615904] [2019-12-07 13:17:47,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 13:17:47,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:17:47,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 13:17:47,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-07 13:17:47,224 INFO L87 Difference]: Start difference. First operand 997 states and 2200 transitions. Second operand 12 states. [2019-12-07 13:17:48,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:17:48,849 INFO L93 Difference]: Finished difference Result 3103 states and 6554 transitions. [2019-12-07 13:17:48,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-07 13:17:48,849 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2019-12-07 13:17:48,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:17:48,850 INFO L225 Difference]: With dead ends: 3103 [2019-12-07 13:17:48,850 INFO L226 Difference]: Without dead ends: 1841 [2019-12-07 13:17:48,851 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=233, Invalid=889, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 13:17:48,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1841 states. [2019-12-07 13:17:48,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1841 to 1047. [2019-12-07 13:17:48,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1047 states. [2019-12-07 13:17:48,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 2319 transitions. [2019-12-07 13:17:48,861 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 2319 transitions. Word has length 53 [2019-12-07 13:17:48,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:17:48,861 INFO L462 AbstractCegarLoop]: Abstraction has 1047 states and 2319 transitions. [2019-12-07 13:17:48,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 13:17:48,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 2319 transitions. [2019-12-07 13:17:48,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 13:17:48,862 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:17:48,862 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] [2019-12-07 13:17:48,862 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:17:48,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:48,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1559154247, now seen corresponding path program 2 times [2019-12-07 13:17:48,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:17:48,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884535158] [2019-12-07 13:17:48,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:48,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:17:48,941 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 13:17:48,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884535158] [2019-12-07 13:17:48,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:17:48,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 13:17:48,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690627932] [2019-12-07 13:17:48,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:17:48,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:17:48,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:17:48,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:17:48,942 INFO L87 Difference]: Start difference. First operand 1047 states and 2319 transitions. Second operand 7 states. [2019-12-07 13:17:49,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:17:49,125 INFO L93 Difference]: Finished difference Result 2647 states and 5660 transitions. [2019-12-07 13:17:49,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 13:17:49,125 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-12-07 13:17:49,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:17:49,126 INFO L225 Difference]: With dead ends: 2647 [2019-12-07 13:17:49,126 INFO L226 Difference]: Without dead ends: 1909 [2019-12-07 13:17:49,126 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-07 13:17:49,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1909 states. [2019-12-07 13:17:49,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1909 to 1060. [2019-12-07 13:17:49,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1060 states. [2019-12-07 13:17:49,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 2337 transitions. [2019-12-07 13:17:49,137 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 2337 transitions. Word has length 53 [2019-12-07 13:17:49,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:17:49,137 INFO L462 AbstractCegarLoop]: Abstraction has 1060 states and 2337 transitions. [2019-12-07 13:17:49,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:17:49,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 2337 transitions. [2019-12-07 13:17:49,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 13:17:49,138 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:17:49,138 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] [2019-12-07 13:17:49,139 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:17:49,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:17:49,139 INFO L82 PathProgramCache]: Analyzing trace with hash -690859281, now seen corresponding path program 3 times [2019-12-07 13:17:49,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:17:49,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414573276] [2019-12-07 13:17:49,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:17:49,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:17:49,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:17:49,216 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 13:17:49,217 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 13:17:49,219 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] ULTIMATE.startENTRY-->L809: Formula: (let ((.cse0 (store |v_#valid_59| 0 0))) (and (= v_~__unbuffered_p0_EBX~0_136 0) (= 0 v_~z$flush_delayed~0_34) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t245~0.base_34|) (= v_~z$w_buff1~0_283 0) (= v_~z~0_158 0) (= v_~z$read_delayed~0_8 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t245~0.base_34|)) (= v_~z$w_buff0~0_493 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t245~0.base_34| 4)) (= v_~z$read_delayed_var~0.base_8 0) (= v_~z$mem_tmp~0_24 0) (= v_~z$w_buff1_used~0_485 0) (= 0 v_~__unbuffered_p0_EAX~0_136) (= v_~z$r_buff1_thd1~0_163 0) (= 0 |v_#NULL.base_4|) (= 0 v_~x~0_115) (= v_~main$tmp_guard0~0_20 0) (= v_~z$r_buff1_thd2~0_305 0) (= v_~z$r_buff1_thd0~0_183 0) (= 0 |v_ULTIMATE.start_main_~#t245~0.offset_22|) (= 0 v_~weak$$choice0~0_22) (= v_~z$r_buff0_thd1~0_272 0) (= |v_#NULL.offset_4| 0) (= v_~z$w_buff0_used~0_741 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t245~0.base_34| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t245~0.base_34|) |v_ULTIMATE.start_main_~#t245~0.offset_22| 0)) |v_#memory_int_15|) (= 0 v_~__unbuffered_cnt~0_48) (= (store .cse0 |v_ULTIMATE.start_main_~#t245~0.base_34| 1) |v_#valid_57|) (= v_~weak$$choice2~0_119 0) (= 0 v_~__unbuffered_p1_EAX~0_41) (= v_~y~0_114 0) (= v_~__unbuffered_p1_EBX~0_43 0) (= v_~z$read_delayed_var~0.offset_8 0) (= v_~z$r_buff0_thd0~0_163 0) (= v_~z$r_buff0_thd2~0_362 0) (< 0 |v_#StackHeapBarrier_13|) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_305, ~z$read_delayed~0=v_~z$read_delayed~0_8, ULTIMATE.start_main_~#t245~0.offset=|v_ULTIMATE.start_main_~#t245~0.offset_22|, ~z$w_buff1~0=v_~z$w_buff1~0_283, #NULL.offset=|v_#NULL.offset_4|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_27|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_35|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_63|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_41|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_163, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_136, ULTIMATE.start_main_~#t245~0.base=|v_ULTIMATE.start_main_~#t245~0.base_34|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_41, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_183, #length=|v_#length_19|, ~y~0=v_~y~0_114, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_362, ~z$mem_tmp~0=v_~z$mem_tmp~0_24, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_43, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_136, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_741, ~z$w_buff0~0=v_~z$w_buff0~0_493, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_485, ~z$flush_delayed~0=v_~z$flush_delayed~0_34, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, #NULL.base=|v_#NULL.base_4|, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_29|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_47|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_57|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_163, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ULTIMATE.start_main_~#t246~0.base=|v_ULTIMATE.start_main_~#t246~0.base_31|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~z~0=v_~z~0_158, ULTIMATE.start_main_~#t246~0.offset=|v_ULTIMATE.start_main_~#t246~0.offset_21|, ~weak$$choice2~0=v_~weak$$choice2~0_119, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_272, ~x~0=v_~x~0_115} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ~z$read_delayed~0, ULTIMATE.start_main_~#t245~0.offset, ~z$w_buff1~0, #NULL.offset, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t245~0.base, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ULTIMATE.start_main_~#t246~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ULTIMATE.start_main_~#t246~0.offset, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-07 13:17:49,220 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L4-->L750: Formula: (and (= ~__unbuffered_p0_EAX~0_Out545921100 ~x~0_Out545921100) (= ~z$r_buff1_thd0~0_Out545921100 ~z$r_buff0_thd0~0_In545921100) (= 1 ~z$r_buff0_thd1~0_Out545921100) (= ~x~0_Out545921100 1) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In545921100 0)) (= ~z$r_buff0_thd2~0_In545921100 ~z$r_buff1_thd2~0_Out545921100) (= ~z$r_buff0_thd1~0_In545921100 ~z$r_buff1_thd1~0_Out545921100) (= ~y~0_In545921100 ~__unbuffered_p0_EBX~0_Out545921100)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In545921100, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In545921100, ~y~0=~y~0_In545921100, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In545921100, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In545921100} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out545921100, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In545921100, ~__unbuffered_p0_EBX~0=~__unbuffered_p0_EBX~0_Out545921100, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out545921100, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out545921100, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out545921100, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In545921100, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out545921100, ~y~0=~y~0_In545921100, ~x~0=~x~0_Out545921100, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In545921100} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-07 13:17:49,220 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L809-1-->L811: Formula: (and (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t246~0.base_12| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t246~0.base_12|) |v_ULTIMATE.start_main_~#t246~0.offset_11| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t246~0.base_12|)) (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t246~0.base_12| 1)) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t246~0.base_12| 4) |v_#length_11|) (= 0 (select |v_#valid_26| |v_ULTIMATE.start_main_~#t246~0.base_12|)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t246~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t246~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_8|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, ULTIMATE.start_main_~#t246~0.base=|v_ULTIMATE.start_main_~#t246~0.base_12|, #length=|v_#length_11|, ULTIMATE.start_main_~#t246~0.offset=|v_ULTIMATE.start_main_~#t246~0.offset_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t246~0.base, #length, ULTIMATE.start_main_~#t246~0.offset] because there is no mapped edge [2019-12-07 13:17:49,222 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L777-->L777-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1726028292 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite21_Out-1726028292| |P1Thread1of1ForFork1_#t~ite20_Out-1726028292|) (= ~z$w_buff0_used~0_In-1726028292 |P1Thread1of1ForFork1_#t~ite20_Out-1726028292|) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-1726028292 256)))) (or (and (= 0 (mod ~z$r_buff1_thd2~0_In-1726028292 256)) .cse0) (= 0 (mod ~z$w_buff0_used~0_In-1726028292 256)) (and (= 0 (mod ~z$w_buff1_used~0_In-1726028292 256)) .cse0))) .cse1) (and (= |P1Thread1of1ForFork1_#t~ite20_In-1726028292| |P1Thread1of1ForFork1_#t~ite20_Out-1726028292|) (not .cse1) (= ~z$w_buff0_used~0_In-1726028292 |P1Thread1of1ForFork1_#t~ite21_Out-1726028292|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1726028292, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-1726028292|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1726028292, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1726028292, ~weak$$choice2~0=~weak$$choice2~0_In-1726028292, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1726028292} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1726028292, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-1726028292|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1726028292, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1726028292, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-1726028292|, ~weak$$choice2~0=~weak$$choice2~0_In-1726028292, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1726028292} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 13:17:49,223 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L779-->L780: Formula: (and (= v_~z$r_buff0_thd2~0_119 v_~z$r_buff0_thd2~0_120) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~weak$$choice2~0=v_~weak$$choice2~0_28, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_120} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~weak$$choice2~0=v_~weak$$choice2~0_28, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_119, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_12|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~z$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 13:17:49,223 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L780-->L780-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1577555038 256)))) (or (and .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In-1577555038 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In-1577555038 256)) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In-1577555038 256))) (and .cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-1577555038 256))))) (= |P1Thread1of1ForFork1_#t~ite29_Out-1577555038| ~z$r_buff1_thd2~0_In-1577555038) (= |P1Thread1of1ForFork1_#t~ite29_Out-1577555038| |P1Thread1of1ForFork1_#t~ite30_Out-1577555038|)) (and (not .cse0) (= ~z$r_buff1_thd2~0_In-1577555038 |P1Thread1of1ForFork1_#t~ite30_Out-1577555038|) (= |P1Thread1of1ForFork1_#t~ite29_In-1577555038| |P1Thread1of1ForFork1_#t~ite29_Out-1577555038|)))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-1577555038|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1577555038, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1577555038, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1577555038, ~weak$$choice2~0=~weak$$choice2~0_In-1577555038, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1577555038} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-1577555038|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-1577555038|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1577555038, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1577555038, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1577555038, ~weak$$choice2~0=~weak$$choice2~0_In-1577555038, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1577555038} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 13:17:49,224 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L782-->L786: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= v_~z~0_49 v_~z$mem_tmp~0_6) (= 0 v_~z$flush_delayed~0_9)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_6, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_49} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 13:17:49,224 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L786-2-->L786-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite33_Out584834903| |P1Thread1of1ForFork1_#t~ite32_Out584834903|)) (.cse1 (= (mod ~z$r_buff1_thd2~0_In584834903 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In584834903 256) 0))) (or (and .cse0 (or .cse1 .cse2) (= ~z~0_In584834903 |P1Thread1of1ForFork1_#t~ite32_Out584834903|)) (and .cse0 (not .cse1) (= ~z$w_buff1~0_In584834903 |P1Thread1of1ForFork1_#t~ite32_Out584834903|) (not .cse2)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In584834903, ~z$w_buff1_used~0=~z$w_buff1_used~0_In584834903, ~z$w_buff1~0=~z$w_buff1~0_In584834903, ~z~0=~z~0_In584834903} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In584834903, ~z$w_buff1_used~0=~z$w_buff1_used~0_In584834903, ~z$w_buff1~0=~z$w_buff1~0_In584834903, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out584834903|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out584834903|, ~z~0=~z~0_In584834903} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-07 13:17:49,224 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L787-->L787-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-978796240 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-978796240 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out-978796240| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out-978796240| ~z$w_buff0_used~0_In-978796240)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-978796240, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-978796240} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-978796240, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-978796240|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-978796240} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 13:17:49,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L788-->L788-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In1831556384 256))) (.cse3 (= (mod ~z$r_buff0_thd2~0_In1831556384 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd2~0_In1831556384 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1831556384 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite35_Out1831556384| ~z$w_buff1_used~0_In1831556384)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out1831556384|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1831556384, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1831556384, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1831556384, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1831556384} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1831556384, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1831556384, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1831556384, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1831556384|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1831556384} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 13:17:49,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L789-->L789-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In192437839 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In192437839 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out192437839| 0)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd2~0_In192437839 |P1Thread1of1ForFork1_#t~ite36_Out192437839|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In192437839, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In192437839} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In192437839, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In192437839, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out192437839|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 13:17:49,225 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L751-->L751-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-647163331 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In-647163331 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-647163331| 0) (not .cse0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-647163331| ~z$w_buff0_used~0_In-647163331) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-647163331, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-647163331} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-647163331|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-647163331, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-647163331} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 13:17:49,226 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L752-->L752-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd1~0_In-888077189 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-888077189 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In-888077189 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-888077189 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-888077189 |P0Thread1of1ForFork0_#t~ite6_Out-888077189|) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-888077189|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-888077189, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-888077189, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-888077189, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-888077189} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-888077189|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-888077189, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-888077189, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-888077189, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-888077189} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 13:17:49,226 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L790-->L790-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In1922381897 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In1922381897 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In1922381897 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd2~0_In1922381897 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd2~0_In1922381897 |P1Thread1of1ForFork1_#t~ite37_Out1922381897|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out1922381897|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1922381897, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1922381897, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1922381897, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1922381897} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1922381897, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1922381897, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1922381897, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1922381897, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1922381897|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 13:17:49,226 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L790-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_131 |v_P1Thread1of1ForFork1_#t~ite37_22|) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1)) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_22|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_131, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_21|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 13:17:49,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L753-->L754: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In138806683 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In138806683 256))) (.cse2 (= ~z$r_buff0_thd1~0_In138806683 ~z$r_buff0_thd1~0_Out138806683))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd1~0_Out138806683) (not .cse1)) (and .cse1 .cse2) (and .cse0 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In138806683, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In138806683} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In138806683, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out138806683|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out138806683} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 13:17:49,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L754-->L754-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1654091222 256))) (.cse0 (= (mod ~z$r_buff0_thd1~0_In-1654091222 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In-1654091222 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1654091222 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1654091222| ~z$r_buff1_thd1~0_In-1654091222) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1654091222| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1654091222, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1654091222, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1654091222, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1654091222} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1654091222, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1654091222|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1654091222, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1654091222, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1654091222} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 13:17:49,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L754-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~z$r_buff1_thd1~0_65 |v_P0Thread1of1ForFork0_#t~ite8_22|) (= (+ v_~__unbuffered_cnt~0_28 1) v_~__unbuffered_cnt~0_27)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_21|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_65, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 13:17:49,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L811-1-->L817: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_15) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 13:17:49,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L817-2-->L817-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-579955317 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-579955317 256) 0))) (or (and (or .cse0 .cse1) (= ~z~0_In-579955317 |ULTIMATE.start_main_#t~ite40_Out-579955317|)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-579955317| ~z$w_buff1~0_In-579955317)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-579955317, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-579955317, ~z$w_buff1~0=~z$w_buff1~0_In-579955317, ~z~0=~z~0_In-579955317} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-579955317|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-579955317, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-579955317, ~z$w_buff1~0=~z$w_buff1~0_In-579955317, ~z~0=~z~0_In-579955317} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 13:17:49,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L817-4-->L818: Formula: (= v_~z~0_42 |v_ULTIMATE.start_main_#t~ite40_16|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_16|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_15|, ~z~0=v_~z~0_42} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~z~0] because there is no mapped edge [2019-12-07 13:17:49,227 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L818-->L818-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-166918850 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-166918850 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out-166918850| 0)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-166918850 |ULTIMATE.start_main_#t~ite42_Out-166918850|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-166918850, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-166918850} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-166918850, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-166918850, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-166918850|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 13:17:49,228 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L819-->L819-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-2035003079 256))) (.cse3 (= (mod ~z$r_buff0_thd0~0_In-2035003079 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-2035003079 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-2035003079 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite43_Out-2035003079| ~z$w_buff1_used~0_In-2035003079)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite43_Out-2035003079| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2035003079, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2035003079, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2035003079, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2035003079} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2035003079, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2035003079, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2035003079, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2035003079, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-2035003079|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 13:17:49,228 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L820-->L820-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In1998169137 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1998169137 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out1998169137| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite44_Out1998169137| ~z$r_buff0_thd0~0_In1998169137) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1998169137, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1998169137} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1998169137, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1998169137, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1998169137|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 13:17:49,229 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L821-->L821-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In-221883058 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-221883058 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-221883058 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-221883058 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-221883058| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite45_Out-221883058| ~z$r_buff1_thd0~0_In-221883058) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-221883058, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-221883058, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-221883058, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-221883058} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-221883058, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-221883058, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-221883058, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-221883058, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-221883058|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 13:17:49,229 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L821-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_~z$r_buff1_thd0~0_161 |v_ULTIMATE.start_main_#t~ite45_31|) (= v_~main$tmp_guard1~0_18 (ite (= (ite (not (and (= v_~__unbuffered_p0_EBX~0_116 0) (= 1 v_~__unbuffered_p1_EAX~0_21) (= 1 v_~__unbuffered_p0_EAX~0_116) (= v_~__unbuffered_p1_EBX~0_22 0))) 1 0) 0) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_18 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_116, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_116, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_116, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_116, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_161, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 13:17:49,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:17:49 BasicIcfg [2019-12-07 13:17:49,271 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 13:17:49,272 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 13:17:49,272 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 13:17:49,272 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 13:17:49,272 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:17:38" (3/4) ... [2019-12-07 13:17:49,274 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 13:17:49,274 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] ULTIMATE.startENTRY-->L809: Formula: (let ((.cse0 (store |v_#valid_59| 0 0))) (and (= v_~__unbuffered_p0_EBX~0_136 0) (= 0 v_~z$flush_delayed~0_34) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t245~0.base_34|) (= v_~z$w_buff1~0_283 0) (= v_~z~0_158 0) (= v_~z$read_delayed~0_8 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t245~0.base_34|)) (= v_~z$w_buff0~0_493 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t245~0.base_34| 4)) (= v_~z$read_delayed_var~0.base_8 0) (= v_~z$mem_tmp~0_24 0) (= v_~z$w_buff1_used~0_485 0) (= 0 v_~__unbuffered_p0_EAX~0_136) (= v_~z$r_buff1_thd1~0_163 0) (= 0 |v_#NULL.base_4|) (= 0 v_~x~0_115) (= v_~main$tmp_guard0~0_20 0) (= v_~z$r_buff1_thd2~0_305 0) (= v_~z$r_buff1_thd0~0_183 0) (= 0 |v_ULTIMATE.start_main_~#t245~0.offset_22|) (= 0 v_~weak$$choice0~0_22) (= v_~z$r_buff0_thd1~0_272 0) (= |v_#NULL.offset_4| 0) (= v_~z$w_buff0_used~0_741 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t245~0.base_34| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t245~0.base_34|) |v_ULTIMATE.start_main_~#t245~0.offset_22| 0)) |v_#memory_int_15|) (= 0 v_~__unbuffered_cnt~0_48) (= (store .cse0 |v_ULTIMATE.start_main_~#t245~0.base_34| 1) |v_#valid_57|) (= v_~weak$$choice2~0_119 0) (= 0 v_~__unbuffered_p1_EAX~0_41) (= v_~y~0_114 0) (= v_~__unbuffered_p1_EBX~0_43 0) (= v_~z$read_delayed_var~0.offset_8 0) (= v_~z$r_buff0_thd0~0_163 0) (= v_~z$r_buff0_thd2~0_362 0) (< 0 |v_#StackHeapBarrier_13|) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_305, ~z$read_delayed~0=v_~z$read_delayed~0_8, ULTIMATE.start_main_~#t245~0.offset=|v_ULTIMATE.start_main_~#t245~0.offset_22|, ~z$w_buff1~0=v_~z$w_buff1~0_283, #NULL.offset=|v_#NULL.offset_4|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_27|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_35|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_63|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_41|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_163, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_136, ULTIMATE.start_main_~#t245~0.base=|v_ULTIMATE.start_main_~#t245~0.base_34|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_41, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_183, #length=|v_#length_19|, ~y~0=v_~y~0_114, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_362, ~z$mem_tmp~0=v_~z$mem_tmp~0_24, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_43, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_136, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_741, ~z$w_buff0~0=v_~z$w_buff0~0_493, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_485, ~z$flush_delayed~0=v_~z$flush_delayed~0_34, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_20, #NULL.base=|v_#NULL.base_4|, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_29|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_47|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_57|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_163, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ULTIMATE.start_main_~#t246~0.base=|v_ULTIMATE.start_main_~#t246~0.base_31|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~z~0=v_~z~0_158, ULTIMATE.start_main_~#t246~0.offset=|v_ULTIMATE.start_main_~#t246~0.offset_21|, ~weak$$choice2~0=v_~weak$$choice2~0_119, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_272, ~x~0=v_~x~0_115} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ~z$read_delayed~0, ULTIMATE.start_main_~#t245~0.offset, ~z$w_buff1~0, #NULL.offset, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t245~0.base, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ULTIMATE.start_main_~#t246~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ULTIMATE.start_main_~#t246~0.offset, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-07 13:17:49,275 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L4-->L750: Formula: (and (= ~__unbuffered_p0_EAX~0_Out545921100 ~x~0_Out545921100) (= ~z$r_buff1_thd0~0_Out545921100 ~z$r_buff0_thd0~0_In545921100) (= 1 ~z$r_buff0_thd1~0_Out545921100) (= ~x~0_Out545921100 1) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In545921100 0)) (= ~z$r_buff0_thd2~0_In545921100 ~z$r_buff1_thd2~0_Out545921100) (= ~z$r_buff0_thd1~0_In545921100 ~z$r_buff1_thd1~0_Out545921100) (= ~y~0_In545921100 ~__unbuffered_p0_EBX~0_Out545921100)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In545921100, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In545921100, ~y~0=~y~0_In545921100, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In545921100, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In545921100} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out545921100, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In545921100, ~__unbuffered_p0_EBX~0=~__unbuffered_p0_EBX~0_Out545921100, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out545921100, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out545921100, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out545921100, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In545921100, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out545921100, ~y~0=~y~0_In545921100, ~x~0=~x~0_Out545921100, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In545921100} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-07 13:17:49,275 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L809-1-->L811: Formula: (and (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t246~0.base_12| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t246~0.base_12|) |v_ULTIMATE.start_main_~#t246~0.offset_11| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t246~0.base_12|)) (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t246~0.base_12| 1)) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t246~0.base_12| 4) |v_#length_11|) (= 0 (select |v_#valid_26| |v_ULTIMATE.start_main_~#t246~0.base_12|)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t246~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t246~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_8|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, ULTIMATE.start_main_~#t246~0.base=|v_ULTIMATE.start_main_~#t246~0.base_12|, #length=|v_#length_11|, ULTIMATE.start_main_~#t246~0.offset=|v_ULTIMATE.start_main_~#t246~0.offset_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t246~0.base, #length, ULTIMATE.start_main_~#t246~0.offset] because there is no mapped edge [2019-12-07 13:17:49,277 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L777-->L777-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1726028292 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite21_Out-1726028292| |P1Thread1of1ForFork1_#t~ite20_Out-1726028292|) (= ~z$w_buff0_used~0_In-1726028292 |P1Thread1of1ForFork1_#t~ite20_Out-1726028292|) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-1726028292 256)))) (or (and (= 0 (mod ~z$r_buff1_thd2~0_In-1726028292 256)) .cse0) (= 0 (mod ~z$w_buff0_used~0_In-1726028292 256)) (and (= 0 (mod ~z$w_buff1_used~0_In-1726028292 256)) .cse0))) .cse1) (and (= |P1Thread1of1ForFork1_#t~ite20_In-1726028292| |P1Thread1of1ForFork1_#t~ite20_Out-1726028292|) (not .cse1) (= ~z$w_buff0_used~0_In-1726028292 |P1Thread1of1ForFork1_#t~ite21_Out-1726028292|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1726028292, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-1726028292|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1726028292, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1726028292, ~weak$$choice2~0=~weak$$choice2~0_In-1726028292, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1726028292} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1726028292, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-1726028292|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1726028292, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1726028292, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-1726028292|, ~weak$$choice2~0=~weak$$choice2~0_In-1726028292, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1726028292} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 13:17:49,278 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L779-->L780: Formula: (and (= v_~z$r_buff0_thd2~0_119 v_~z$r_buff0_thd2~0_120) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~weak$$choice2~0=v_~weak$$choice2~0_28, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_120} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~weak$$choice2~0=v_~weak$$choice2~0_28, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_119, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_12|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~z$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 13:17:49,278 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L780-->L780-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1577555038 256)))) (or (and .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In-1577555038 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In-1577555038 256)) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In-1577555038 256))) (and .cse1 (= 0 (mod ~z$r_buff1_thd2~0_In-1577555038 256))))) (= |P1Thread1of1ForFork1_#t~ite29_Out-1577555038| ~z$r_buff1_thd2~0_In-1577555038) (= |P1Thread1of1ForFork1_#t~ite29_Out-1577555038| |P1Thread1of1ForFork1_#t~ite30_Out-1577555038|)) (and (not .cse0) (= ~z$r_buff1_thd2~0_In-1577555038 |P1Thread1of1ForFork1_#t~ite30_Out-1577555038|) (= |P1Thread1of1ForFork1_#t~ite29_In-1577555038| |P1Thread1of1ForFork1_#t~ite29_Out-1577555038|)))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-1577555038|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1577555038, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1577555038, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1577555038, ~weak$$choice2~0=~weak$$choice2~0_In-1577555038, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1577555038} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-1577555038|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-1577555038|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1577555038, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1577555038, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1577555038, ~weak$$choice2~0=~weak$$choice2~0_In-1577555038, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1577555038} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 13:17:49,278 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L782-->L786: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= v_~z~0_49 v_~z$mem_tmp~0_6) (= 0 v_~z$flush_delayed~0_9)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_6, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_6, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_49} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 13:17:49,278 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L786-2-->L786-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite33_Out584834903| |P1Thread1of1ForFork1_#t~ite32_Out584834903|)) (.cse1 (= (mod ~z$r_buff1_thd2~0_In584834903 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In584834903 256) 0))) (or (and .cse0 (or .cse1 .cse2) (= ~z~0_In584834903 |P1Thread1of1ForFork1_#t~ite32_Out584834903|)) (and .cse0 (not .cse1) (= ~z$w_buff1~0_In584834903 |P1Thread1of1ForFork1_#t~ite32_Out584834903|) (not .cse2)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In584834903, ~z$w_buff1_used~0=~z$w_buff1_used~0_In584834903, ~z$w_buff1~0=~z$w_buff1~0_In584834903, ~z~0=~z~0_In584834903} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In584834903, ~z$w_buff1_used~0=~z$w_buff1_used~0_In584834903, ~z$w_buff1~0=~z$w_buff1~0_In584834903, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out584834903|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out584834903|, ~z~0=~z~0_In584834903} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-07 13:17:49,279 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L787-->L787-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-978796240 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-978796240 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out-978796240| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out-978796240| ~z$w_buff0_used~0_In-978796240)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-978796240, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-978796240} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-978796240, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-978796240|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-978796240} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 13:17:49,279 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L788-->L788-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In1831556384 256))) (.cse3 (= (mod ~z$r_buff0_thd2~0_In1831556384 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd2~0_In1831556384 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1831556384 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite35_Out1831556384| ~z$w_buff1_used~0_In1831556384)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out1831556384|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1831556384, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1831556384, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1831556384, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1831556384} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1831556384, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1831556384, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1831556384, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1831556384|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1831556384} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 13:17:49,279 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L789-->L789-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In192437839 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In192437839 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out192437839| 0)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd2~0_In192437839 |P1Thread1of1ForFork1_#t~ite36_Out192437839|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In192437839, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In192437839} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In192437839, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In192437839, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out192437839|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 13:17:49,280 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L751-->L751-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-647163331 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In-647163331 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-647163331| 0) (not .cse0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-647163331| ~z$w_buff0_used~0_In-647163331) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-647163331, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-647163331} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-647163331|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-647163331, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-647163331} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 13:17:49,280 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L752-->L752-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd1~0_In-888077189 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-888077189 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In-888077189 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-888077189 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-888077189 |P0Thread1of1ForFork0_#t~ite6_Out-888077189|) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-888077189|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-888077189, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-888077189, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-888077189, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-888077189} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-888077189|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-888077189, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-888077189, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-888077189, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-888077189} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 13:17:49,281 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L790-->L790-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In1922381897 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In1922381897 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In1922381897 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd2~0_In1922381897 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd2~0_In1922381897 |P1Thread1of1ForFork1_#t~ite37_Out1922381897|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out1922381897|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1922381897, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1922381897, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1922381897, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1922381897} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1922381897, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1922381897, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1922381897, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1922381897, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1922381897|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 13:17:49,281 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L790-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_131 |v_P1Thread1of1ForFork1_#t~ite37_22|) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1)) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_22|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_131, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_21|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 13:17:49,281 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L753-->L754: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In138806683 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In138806683 256))) (.cse2 (= ~z$r_buff0_thd1~0_In138806683 ~z$r_buff0_thd1~0_Out138806683))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd1~0_Out138806683) (not .cse1)) (and .cse1 .cse2) (and .cse0 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In138806683, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In138806683} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In138806683, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out138806683|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out138806683} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 13:17:49,281 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L754-->L754-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1654091222 256))) (.cse0 (= (mod ~z$r_buff0_thd1~0_In-1654091222 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In-1654091222 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1654091222 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1654091222| ~z$r_buff1_thd1~0_In-1654091222) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1654091222| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1654091222, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1654091222, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1654091222, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1654091222} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1654091222, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1654091222|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1654091222, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1654091222, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1654091222} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 13:17:49,281 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L754-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~z$r_buff1_thd1~0_65 |v_P0Thread1of1ForFork0_#t~ite8_22|) (= (+ v_~__unbuffered_cnt~0_28 1) v_~__unbuffered_cnt~0_27)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_28} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_21|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_65, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_27} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 13:17:49,281 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L811-1-->L817: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_15) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 13:17:49,281 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L817-2-->L817-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-579955317 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-579955317 256) 0))) (or (and (or .cse0 .cse1) (= ~z~0_In-579955317 |ULTIMATE.start_main_#t~ite40_Out-579955317|)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-579955317| ~z$w_buff1~0_In-579955317)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-579955317, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-579955317, ~z$w_buff1~0=~z$w_buff1~0_In-579955317, ~z~0=~z~0_In-579955317} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-579955317|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-579955317, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-579955317, ~z$w_buff1~0=~z$w_buff1~0_In-579955317, ~z~0=~z~0_In-579955317} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 13:17:49,281 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L817-4-->L818: Formula: (= v_~z~0_42 |v_ULTIMATE.start_main_#t~ite40_16|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_16|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_15|, ~z~0=v_~z~0_42} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~z~0] because there is no mapped edge [2019-12-07 13:17:49,282 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L818-->L818-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-166918850 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-166918850 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out-166918850| 0)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-166918850 |ULTIMATE.start_main_#t~ite42_Out-166918850|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-166918850, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-166918850} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-166918850, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-166918850, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-166918850|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 13:17:49,282 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L819-->L819-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-2035003079 256))) (.cse3 (= (mod ~z$r_buff0_thd0~0_In-2035003079 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-2035003079 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-2035003079 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite43_Out-2035003079| ~z$w_buff1_used~0_In-2035003079)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite43_Out-2035003079| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2035003079, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2035003079, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2035003079, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2035003079} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2035003079, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2035003079, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2035003079, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2035003079, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-2035003079|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 13:17:49,282 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L820-->L820-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In1998169137 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1998169137 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out1998169137| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite44_Out1998169137| ~z$r_buff0_thd0~0_In1998169137) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1998169137, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1998169137} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1998169137, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1998169137, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1998169137|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 13:17:49,283 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L821-->L821-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In-221883058 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-221883058 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-221883058 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-221883058 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-221883058| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite45_Out-221883058| ~z$r_buff1_thd0~0_In-221883058) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-221883058, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-221883058, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-221883058, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-221883058} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-221883058, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-221883058, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-221883058, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-221883058, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-221883058|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 13:17:49,283 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L821-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_~z$r_buff1_thd0~0_161 |v_ULTIMATE.start_main_#t~ite45_31|) (= v_~main$tmp_guard1~0_18 (ite (= (ite (not (and (= v_~__unbuffered_p0_EBX~0_116 0) (= 1 v_~__unbuffered_p1_EAX~0_21) (= 1 v_~__unbuffered_p0_EAX~0_116) (= v_~__unbuffered_p1_EBX~0_22 0))) 1 0) 0) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_18 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_116, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_116, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_116, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_116, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_161, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 13:17:49,330 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_e5fe3c23-61f4-4365-a415-6ca3c8496b2c/bin/utaipan/witness.graphml [2019-12-07 13:17:49,331 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 13:17:49,332 INFO L168 Benchmark]: Toolchain (without parser) took 11175.72 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 697.8 MB). Free memory was 940.9 MB in the beginning and 1.4 GB in the end (delta: -456.4 MB). Peak memory consumption was 241.4 MB. Max. memory is 11.5 GB. [2019-12-07 13:17:49,332 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 960.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:17:49,332 INFO L168 Benchmark]: CACSL2BoogieTranslator took 375.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -156.5 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-12-07 13:17:49,333 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 11.5 GB. [2019-12-07 13:17:49,333 INFO L168 Benchmark]: Boogie Preprocessor took 24.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 11.5 GB. [2019-12-07 13:17:49,333 INFO L168 Benchmark]: RCFGBuilder took 386.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.6 MB). Peak memory consumption was 55.6 MB. Max. memory is 11.5 GB. [2019-12-07 13:17:49,333 INFO L168 Benchmark]: TraceAbstraction took 10290.07 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 564.7 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -399.8 MB). Peak memory consumption was 164.9 MB. Max. memory is 11.5 GB. [2019-12-07 13:17:49,334 INFO L168 Benchmark]: Witness Printer took 58.99 ms. Allocated memory is still 1.7 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 37.3 MB). Peak memory consumption was 37.3 MB. Max. memory is 11.5 GB. [2019-12-07 13:17:49,335 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 960.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 375.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -156.5 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 386.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.6 MB). Peak memory consumption was 55.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10290.07 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 564.7 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -399.8 MB). Peak memory consumption was 164.9 MB. Max. memory is 11.5 GB. * Witness Printer took 58.99 ms. Allocated memory is still 1.7 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 37.3 MB). Peak memory consumption was 37.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.2s, 150 ProgramPointsBefore, 77 ProgramPointsAfterwards, 184 TransitionsBefore, 88 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 8 FixpointIterations, 32 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 26 ChoiceCompositions, 4687 VarBasedMoverChecksPositive, 200 VarBasedMoverChecksNegative, 39 SemBasedMoverChecksPositive, 206 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.9s, 0 MoverChecksTotal, 54623 CheckedPairsTotal, 105 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L809] FCALL, FORK 0 pthread_create(&t245, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L730] 1 z$w_buff1 = z$w_buff0 [L731] 1 z$w_buff0 = 1 [L732] 1 z$w_buff1_used = z$w_buff0_used [L733] 1 z$w_buff0_used = (_Bool)1 [L750] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] FCALL, FORK 0 pthread_create(&t246, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 y = 1 [L767] 2 __unbuffered_p1_EAX = y [L770] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L771] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L772] 2 z$flush_delayed = weak$$choice2 [L773] 2 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L775] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L776] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L777] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L778] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L787] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L788] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L750] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L751] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L752] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L789] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L817] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L819] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L820] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 144 locations, 2 error locations. Result: UNSAFE, OverallTime: 10.1s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2255 SDtfs, 1895 SDslu, 5134 SDs, 0 SdLazy, 3781 SolverSat, 116 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 16 SyntacticMatches, 8 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12374occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 15 MinimizatonAttempts, 7940 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 482 NumberOfCodeBlocks, 482 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 414 ConstructedInterpolants, 0 QuantifiedInterpolants, 104048 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...