./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi007_rmo.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_c3906476-5e07-4717-a19f-54860f73c831/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c3906476-5e07-4717-a19f-54860f73c831/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c3906476-5e07-4717-a19f-54860f73c831/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c3906476-5e07-4717-a19f-54860f73c831/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi007_rmo.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_c3906476-5e07-4717-a19f-54860f73c831/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c3906476-5e07-4717-a19f-54860f73c831/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 e1c75c07e8ecf18c400b7c2089e688b990558729 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 12:34:14,356 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:34:14,357 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:34:14,365 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:34:14,365 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:34:14,366 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:34:14,367 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:34:14,368 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:34:14,369 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:34:14,370 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:34:14,370 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:34:14,371 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:34:14,371 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:34:14,372 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:34:14,373 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:34:14,374 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:34:14,374 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:34:14,375 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:34:14,376 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:34:14,378 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:34:14,379 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:34:14,380 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:34:14,381 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:34:14,381 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:34:14,383 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:34:14,383 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:34:14,383 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:34:14,384 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:34:14,384 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:34:14,384 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:34:14,385 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:34:14,385 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:34:14,385 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:34:14,386 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:34:14,386 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:34:14,387 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:34:14,387 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:34:14,387 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:34:14,387 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:34:14,388 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:34:14,388 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:34:14,389 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c3906476-5e07-4717-a19f-54860f73c831/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 12:34:14,398 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:34:14,399 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:34:14,399 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 12:34:14,399 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 12:34:14,399 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 12:34:14,399 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 12:34:14,399 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 12:34:14,400 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 12:34:14,400 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 12:34:14,400 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 12:34:14,400 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 12:34:14,400 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 12:34:14,400 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 12:34:14,400 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 12:34:14,400 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 12:34:14,401 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:34:14,401 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:34:14,401 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:34:14,401 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:34:14,401 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:34:14,401 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 12:34:14,401 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:34:14,401 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 12:34:14,401 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 12:34:14,402 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:34:14,402 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 12:34:14,402 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:34:14,402 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 12:34:14,402 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:34:14,402 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:34:14,402 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:34:14,402 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:34:14,403 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:34:14,403 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:34:14,403 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 12:34:14,403 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 12:34:14,403 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 12:34:14,403 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 12:34:14,403 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:34:14,403 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 12:34:14,403 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_c3906476-5e07-4717-a19f-54860f73c831/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 -> e1c75c07e8ecf18c400b7c2089e688b990558729 [2019-12-07 12:34:14,505 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:34:14,516 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:34:14,518 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:34:14,519 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:34:14,520 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:34:14,520 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c3906476-5e07-4717-a19f-54860f73c831/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/rfi007_rmo.oepc.i [2019-12-07 12:34:14,560 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c3906476-5e07-4717-a19f-54860f73c831/bin/utaipan/data/8c7efbf78/95e3643376a94d308fe1dd35b02640e2/FLAGb18c501b9 [2019-12-07 12:34:15,023 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:34:15,024 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c3906476-5e07-4717-a19f-54860f73c831/sv-benchmarks/c/pthread-wmm/rfi007_rmo.oepc.i [2019-12-07 12:34:15,033 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c3906476-5e07-4717-a19f-54860f73c831/bin/utaipan/data/8c7efbf78/95e3643376a94d308fe1dd35b02640e2/FLAGb18c501b9 [2019-12-07 12:34:15,042 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c3906476-5e07-4717-a19f-54860f73c831/bin/utaipan/data/8c7efbf78/95e3643376a94d308fe1dd35b02640e2 [2019-12-07 12:34:15,044 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:34:15,045 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:34:15,046 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:34:15,046 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:34:15,048 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:34:15,049 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:34:15" (1/1) ... [2019-12-07 12:34:15,050 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f8fae9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:34:15, skipping insertion in model container [2019-12-07 12:34:15,051 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:34:15" (1/1) ... [2019-12-07 12:34:15,056 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:34:15,088 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:34:15,378 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:34:15,387 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:34:15,433 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:34:15,487 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:34:15,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:34:15 WrapperNode [2019-12-07 12:34:15,487 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:34:15,488 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:34:15,488 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:34:15,488 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:34:15,495 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:34:15" (1/1) ... [2019-12-07 12:34:15,513 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:34:15" (1/1) ... [2019-12-07 12:34:15,541 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:34:15,541 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:34:15,541 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:34:15,542 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:34:15,551 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:34:15" (1/1) ... [2019-12-07 12:34:15,552 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:34:15" (1/1) ... [2019-12-07 12:34:15,555 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:34:15" (1/1) ... [2019-12-07 12:34:15,556 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:34:15" (1/1) ... [2019-12-07 12:34:15,563 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:34:15" (1/1) ... [2019-12-07 12:34:15,567 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:34:15" (1/1) ... [2019-12-07 12:34:15,569 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:34:15" (1/1) ... [2019-12-07 12:34:15,573 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:34:15,574 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:34:15,574 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:34:15,574 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:34:15,575 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:34:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c3906476-5e07-4717-a19f-54860f73c831/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 12:34:15,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 12:34:15,619 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 12:34:15,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 12:34:15,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 12:34:15,619 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 12:34:15,619 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 12:34:15,619 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 12:34:15,620 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 12:34:15,620 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 12:34:15,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:34:15,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:34:15,621 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 12:34:15,962 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:34:15,962 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 12:34:15,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:34:15 BoogieIcfgContainer [2019-12-07 12:34:15,963 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:34:15,963 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:34:15,964 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:34:15,965 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:34:15,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:34:15" (1/3) ... [2019-12-07 12:34:15,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4db49359 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:34:15, skipping insertion in model container [2019-12-07 12:34:15,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:34:15" (2/3) ... [2019-12-07 12:34:15,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4db49359 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:34:15, skipping insertion in model container [2019-12-07 12:34:15,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:34:15" (3/3) ... [2019-12-07 12:34:15,967 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi007_rmo.oepc.i [2019-12-07 12:34:15,973 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 12:34:15,974 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:34:15,978 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 12:34:15,979 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 12:34:16,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,002 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,002 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,002 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,002 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,002 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,007 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,007 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,017 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,018 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,019 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:34:16,030 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 12:34:16,042 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:34:16,042 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 12:34:16,043 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:34:16,043 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:34:16,043 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:34:16,043 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:34:16,043 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:34:16,043 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:34:16,053 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-07 12:34:16,054 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-07 12:34:16,102 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-07 12:34:16,102 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 12:34:16,110 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 560 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 12:34:16,121 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-07 12:34:16,147 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-07 12:34:16,147 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 12:34:16,150 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 560 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 12:34:16,160 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-07 12:34:16,161 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 12:34:18,781 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-07 12:34:19,089 INFO L206 etLargeBlockEncoding]: Checked pairs total: 76691 [2019-12-07 12:34:19,089 INFO L214 etLargeBlockEncoding]: Total number of compositions: 108 [2019-12-07 12:34:19,092 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 90 transitions [2019-12-07 12:34:19,480 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9438 states. [2019-12-07 12:34:19,482 INFO L276 IsEmpty]: Start isEmpty. Operand 9438 states. [2019-12-07 12:34:19,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 12:34:19,486 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:34:19,486 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 12:34:19,487 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:34:19,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:34:19,490 INFO L82 PathProgramCache]: Analyzing trace with hash 790297, now seen corresponding path program 1 times [2019-12-07 12:34:19,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:34:19,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114243098] [2019-12-07 12:34:19,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:34:19,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:34:19,642 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 12:34:19,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114243098] [2019-12-07 12:34:19,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:34:19,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 12:34:19,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889476466] [2019-12-07 12:34:19,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:34:19,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:34:19,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:34:19,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:34:19,667 INFO L87 Difference]: Start difference. First operand 9438 states. Second operand 3 states. [2019-12-07 12:34:19,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:34:19,863 INFO L93 Difference]: Finished difference Result 9266 states and 29920 transitions. [2019-12-07 12:34:19,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:34:19,864 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 12:34:19,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:34:19,927 INFO L225 Difference]: With dead ends: 9266 [2019-12-07 12:34:19,927 INFO L226 Difference]: Without dead ends: 8258 [2019-12-07 12:34:19,928 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 12:34:20,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8258 states. [2019-12-07 12:34:20,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8258 to 8258. [2019-12-07 12:34:20,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8258 states. [2019-12-07 12:34:20,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8258 states to 8258 states and 26572 transitions. [2019-12-07 12:34:20,244 INFO L78 Accepts]: Start accepts. Automaton has 8258 states and 26572 transitions. Word has length 3 [2019-12-07 12:34:20,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:34:20,245 INFO L462 AbstractCegarLoop]: Abstraction has 8258 states and 26572 transitions. [2019-12-07 12:34:20,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:34:20,245 INFO L276 IsEmpty]: Start isEmpty. Operand 8258 states and 26572 transitions. [2019-12-07 12:34:20,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 12:34:20,247 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:34:20,248 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:34:20,248 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:34:20,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:34:20,248 INFO L82 PathProgramCache]: Analyzing trace with hash 316025548, now seen corresponding path program 1 times [2019-12-07 12:34:20,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:34:20,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673473509] [2019-12-07 12:34:20,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:34:20,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:34:20,326 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 12:34:20,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673473509] [2019-12-07 12:34:20,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:34:20,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:34:20,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070108608] [2019-12-07 12:34:20,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:34:20,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:34:20,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:34:20,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:34:20,329 INFO L87 Difference]: Start difference. First operand 8258 states and 26572 transitions. Second operand 4 states. [2019-12-07 12:34:20,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:34:20,583 INFO L93 Difference]: Finished difference Result 12603 states and 38772 transitions. [2019-12-07 12:34:20,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:34:20,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 12:34:20,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:34:20,650 INFO L225 Difference]: With dead ends: 12603 [2019-12-07 12:34:20,650 INFO L226 Difference]: Without dead ends: 12589 [2019-12-07 12:34:20,651 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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 12:34:20,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12589 states. [2019-12-07 12:34:20,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12589 to 11299. [2019-12-07 12:34:20,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11299 states. [2019-12-07 12:34:20,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11299 states to 11299 states and 35365 transitions. [2019-12-07 12:34:20,910 INFO L78 Accepts]: Start accepts. Automaton has 11299 states and 35365 transitions. Word has length 11 [2019-12-07 12:34:20,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:34:20,910 INFO L462 AbstractCegarLoop]: Abstraction has 11299 states and 35365 transitions. [2019-12-07 12:34:20,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:34:20,911 INFO L276 IsEmpty]: Start isEmpty. Operand 11299 states and 35365 transitions. [2019-12-07 12:34:20,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 12:34:20,915 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:34:20,915 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:34:20,915 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:34:20,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:34:20,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1209477957, now seen corresponding path program 1 times [2019-12-07 12:34:20,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:34:20,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972763926] [2019-12-07 12:34:20,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:34:20,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:34:20,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:34:20,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972763926] [2019-12-07 12:34:20,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:34:20,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:34:20,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669841784] [2019-12-07 12:34:20,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:34:20,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:34:20,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:34:20,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:34:20,980 INFO L87 Difference]: Start difference. First operand 11299 states and 35365 transitions. Second operand 4 states. [2019-12-07 12:34:21,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:34:21,141 INFO L93 Difference]: Finished difference Result 13736 states and 42816 transitions. [2019-12-07 12:34:21,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:34:21,141 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 12:34:21,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:34:21,175 INFO L225 Difference]: With dead ends: 13736 [2019-12-07 12:34:21,175 INFO L226 Difference]: Without dead ends: 13736 [2019-12-07 12:34:21,176 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 12:34:21,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13736 states. [2019-12-07 12:34:21,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13736 to 12234. [2019-12-07 12:34:21,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12234 states. [2019-12-07 12:34:21,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12234 states to 12234 states and 38359 transitions. [2019-12-07 12:34:21,465 INFO L78 Accepts]: Start accepts. Automaton has 12234 states and 38359 transitions. Word has length 14 [2019-12-07 12:34:21,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:34:21,466 INFO L462 AbstractCegarLoop]: Abstraction has 12234 states and 38359 transitions. [2019-12-07 12:34:21,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:34:21,466 INFO L276 IsEmpty]: Start isEmpty. Operand 12234 states and 38359 transitions. [2019-12-07 12:34:21,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 12:34:21,469 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:34:21,469 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:34:21,469 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:34:21,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:34:21,470 INFO L82 PathProgramCache]: Analyzing trace with hash -572907870, now seen corresponding path program 1 times [2019-12-07 12:34:21,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:34:21,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843592457] [2019-12-07 12:34:21,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:34:21,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:34:21,524 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 12:34:21,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843592457] [2019-12-07 12:34:21,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:34:21,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:34:21,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243768872] [2019-12-07 12:34:21,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:34:21,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:34:21,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:34:21,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:34:21,526 INFO L87 Difference]: Start difference. First operand 12234 states and 38359 transitions. Second operand 3 states. [2019-12-07 12:34:21,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:34:21,570 INFO L93 Difference]: Finished difference Result 11576 states and 35711 transitions. [2019-12-07 12:34:21,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:34:21,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 12:34:21,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:34:21,586 INFO L225 Difference]: With dead ends: 11576 [2019-12-07 12:34:21,586 INFO L226 Difference]: Without dead ends: 11576 [2019-12-07 12:34:21,586 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 12:34:21,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11576 states. [2019-12-07 12:34:21,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11576 to 11496. [2019-12-07 12:34:21,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11496 states. [2019-12-07 12:34:21,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11496 states to 11496 states and 35479 transitions. [2019-12-07 12:34:21,793 INFO L78 Accepts]: Start accepts. Automaton has 11496 states and 35479 transitions. Word has length 16 [2019-12-07 12:34:21,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:34:21,793 INFO L462 AbstractCegarLoop]: Abstraction has 11496 states and 35479 transitions. [2019-12-07 12:34:21,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:34:21,794 INFO L276 IsEmpty]: Start isEmpty. Operand 11496 states and 35479 transitions. [2019-12-07 12:34:21,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 12:34:21,796 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:34:21,796 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:34:21,796 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:34:21,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:34:21,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1184696536, now seen corresponding path program 1 times [2019-12-07 12:34:21,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:34:21,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766497080] [2019-12-07 12:34:21,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:34:21,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:34:21,853 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 12:34:21,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766497080] [2019-12-07 12:34:21,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:34:21,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:34:21,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753951093] [2019-12-07 12:34:21,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:34:21,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:34:21,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:34:21,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:34:21,854 INFO L87 Difference]: Start difference. First operand 11496 states and 35479 transitions. Second operand 4 states. [2019-12-07 12:34:21,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:34:21,876 INFO L93 Difference]: Finished difference Result 2186 states and 5445 transitions. [2019-12-07 12:34:21,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:34:21,876 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 12:34:21,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:34:21,879 INFO L225 Difference]: With dead ends: 2186 [2019-12-07 12:34:21,879 INFO L226 Difference]: Without dead ends: 1542 [2019-12-07 12:34:21,879 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 12:34:21,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1542 states. [2019-12-07 12:34:21,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1542 to 1542. [2019-12-07 12:34:21,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1542 states. [2019-12-07 12:34:21,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 3401 transitions. [2019-12-07 12:34:21,901 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 3401 transitions. Word has length 16 [2019-12-07 12:34:21,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:34:21,901 INFO L462 AbstractCegarLoop]: Abstraction has 1542 states and 3401 transitions. [2019-12-07 12:34:21,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:34:21,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 3401 transitions. [2019-12-07 12:34:21,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 12:34:21,903 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:34:21,903 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:34:21,904 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:34:21,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:34:21,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1133745070, now seen corresponding path program 1 times [2019-12-07 12:34:21,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:34:21,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327669566] [2019-12-07 12:34:21,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:34:21,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:34:22,006 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 12:34:22,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327669566] [2019-12-07 12:34:22,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:34:22,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:34:22,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638701653] [2019-12-07 12:34:22,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:34:22,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:34:22,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:34:22,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:34:22,008 INFO L87 Difference]: Start difference. First operand 1542 states and 3401 transitions. Second operand 6 states. [2019-12-07 12:34:22,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:34:22,378 INFO L93 Difference]: Finished difference Result 4257 states and 9289 transitions. [2019-12-07 12:34:22,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 12:34:22,378 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-07 12:34:22,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:34:22,381 INFO L225 Difference]: With dead ends: 4257 [2019-12-07 12:34:22,381 INFO L226 Difference]: Without dead ends: 4222 [2019-12-07 12:34:22,381 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 12:34:22,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4222 states. [2019-12-07 12:34:22,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4222 to 1876. [2019-12-07 12:34:22,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1876 states. [2019-12-07 12:34:22,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1876 states to 1876 states and 4214 transitions. [2019-12-07 12:34:22,407 INFO L78 Accepts]: Start accepts. Automaton has 1876 states and 4214 transitions. Word has length 25 [2019-12-07 12:34:22,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:34:22,407 INFO L462 AbstractCegarLoop]: Abstraction has 1876 states and 4214 transitions. [2019-12-07 12:34:22,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:34:22,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1876 states and 4214 transitions. [2019-12-07 12:34:22,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 12:34:22,409 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:34:22,409 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:34:22,409 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:34:22,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:34:22,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1963896570, now seen corresponding path program 1 times [2019-12-07 12:34:22,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:34:22,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846272257] [2019-12-07 12:34:22,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:34:22,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:34:22,481 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 12:34:22,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846272257] [2019-12-07 12:34:22,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:34:22,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:34:22,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552552677] [2019-12-07 12:34:22,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:34:22,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:34:22,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:34:22,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:34:22,483 INFO L87 Difference]: Start difference. First operand 1876 states and 4214 transitions. Second operand 6 states. [2019-12-07 12:34:22,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:34:22,866 INFO L93 Difference]: Finished difference Result 3972 states and 8604 transitions. [2019-12-07 12:34:22,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 12:34:22,866 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-07 12:34:22,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:34:22,869 INFO L225 Difference]: With dead ends: 3972 [2019-12-07 12:34:22,869 INFO L226 Difference]: Without dead ends: 3943 [2019-12-07 12:34:22,869 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 12:34:22,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3943 states. [2019-12-07 12:34:22,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3943 to 1855. [2019-12-07 12:34:22,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1855 states. [2019-12-07 12:34:22,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1855 states to 1855 states and 4186 transitions. [2019-12-07 12:34:22,894 INFO L78 Accepts]: Start accepts. Automaton has 1855 states and 4186 transitions. Word has length 26 [2019-12-07 12:34:22,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:34:22,894 INFO L462 AbstractCegarLoop]: Abstraction has 1855 states and 4186 transitions. [2019-12-07 12:34:22,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:34:22,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1855 states and 4186 transitions. [2019-12-07 12:34:22,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 12:34:22,896 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:34:22,896 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:34:22,896 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:34:22,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:34:22,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1348947066, now seen corresponding path program 1 times [2019-12-07 12:34:22,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:34:22,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814033322] [2019-12-07 12:34:22,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:34:22,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:34:22,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:34:22,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814033322] [2019-12-07 12:34:22,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:34:22,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:34:22,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016285314] [2019-12-07 12:34:22,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:34:22,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:34:22,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:34:22,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:34:22,950 INFO L87 Difference]: Start difference. First operand 1855 states and 4186 transitions. Second operand 4 states. [2019-12-07 12:34:22,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:34:22,965 INFO L93 Difference]: Finished difference Result 3310 states and 7474 transitions. [2019-12-07 12:34:22,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:34:22,966 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-07 12:34:22,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:34:22,968 INFO L225 Difference]: With dead ends: 3310 [2019-12-07 12:34:22,968 INFO L226 Difference]: Without dead ends: 2838 [2019-12-07 12:34:22,968 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 12:34:22,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2838 states. [2019-12-07 12:34:22,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2838 to 2810. [2019-12-07 12:34:22,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2810 states. [2019-12-07 12:34:22,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2810 states to 2810 states and 6417 transitions. [2019-12-07 12:34:22,996 INFO L78 Accepts]: Start accepts. Automaton has 2810 states and 6417 transitions. Word has length 27 [2019-12-07 12:34:22,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:34:22,996 INFO L462 AbstractCegarLoop]: Abstraction has 2810 states and 6417 transitions. [2019-12-07 12:34:22,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:34:22,996 INFO L276 IsEmpty]: Start isEmpty. Operand 2810 states and 6417 transitions. [2019-12-07 12:34:23,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 12:34:23,000 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:34:23,000 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 12:34:23,000 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:34:23,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:34:23,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1234551102, now seen corresponding path program 1 times [2019-12-07 12:34:23,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:34:23,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740835136] [2019-12-07 12:34:23,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:34:23,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:34:23,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:34:23,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740835136] [2019-12-07 12:34:23,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:34:23,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:34:23,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548637628] [2019-12-07 12:34:23,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:34:23,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:34:23,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:34:23,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:34:23,065 INFO L87 Difference]: Start difference. First operand 2810 states and 6417 transitions. Second operand 5 states. [2019-12-07 12:34:23,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:34:23,095 INFO L93 Difference]: Finished difference Result 1471 states and 3338 transitions. [2019-12-07 12:34:23,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:34:23,095 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-07 12:34:23,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:34:23,096 INFO L225 Difference]: With dead ends: 1471 [2019-12-07 12:34:23,096 INFO L226 Difference]: Without dead ends: 1312 [2019-12-07 12:34:23,097 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 12:34:23,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2019-12-07 12:34:23,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 841. [2019-12-07 12:34:23,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 841 states. [2019-12-07 12:34:23,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1889 transitions. [2019-12-07 12:34:23,105 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1889 transitions. Word has length 28 [2019-12-07 12:34:23,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:34:23,105 INFO L462 AbstractCegarLoop]: Abstraction has 841 states and 1889 transitions. [2019-12-07 12:34:23,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:34:23,106 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1889 transitions. [2019-12-07 12:34:23,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 12:34:23,107 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:34:23,107 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 12:34:23,107 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:34:23,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:34:23,108 INFO L82 PathProgramCache]: Analyzing trace with hash 551725022, now seen corresponding path program 1 times [2019-12-07 12:34:23,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:34:23,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913123723] [2019-12-07 12:34:23,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:34:23,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:34:23,185 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 12:34:23,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913123723] [2019-12-07 12:34:23,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:34:23,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 12:34:23,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386066531] [2019-12-07 12:34:23,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 12:34:23,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:34:23,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 12:34:23,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:34:23,186 INFO L87 Difference]: Start difference. First operand 841 states and 1889 transitions. Second operand 7 states. [2019-12-07 12:34:23,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:34:23,918 INFO L93 Difference]: Finished difference Result 2377 states and 5135 transitions. [2019-12-07 12:34:23,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 12:34:23,918 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-07 12:34:23,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:34:23,920 INFO L225 Difference]: With dead ends: 2377 [2019-12-07 12:34:23,920 INFO L226 Difference]: Without dead ends: 2377 [2019-12-07 12:34:23,921 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-12-07 12:34:23,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2377 states. [2019-12-07 12:34:23,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2377 to 1134. [2019-12-07 12:34:23,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1134 states. [2019-12-07 12:34:23,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 1134 states and 2521 transitions. [2019-12-07 12:34:23,936 INFO L78 Accepts]: Start accepts. Automaton has 1134 states and 2521 transitions. Word has length 52 [2019-12-07 12:34:23,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:34:23,936 INFO L462 AbstractCegarLoop]: Abstraction has 1134 states and 2521 transitions. [2019-12-07 12:34:23,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 12:34:23,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 2521 transitions. [2019-12-07 12:34:23,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 12:34:23,937 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:34:23,938 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 12:34:23,938 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:34:23,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:34:23,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1381976674, now seen corresponding path program 2 times [2019-12-07 12:34:23,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:34:23,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409206986] [2019-12-07 12:34:23,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:34:23,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:34:24,014 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 12:34:24,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409206986] [2019-12-07 12:34:24,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:34:24,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 12:34:24,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803900540] [2019-12-07 12:34:24,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 12:34:24,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:34:24,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 12:34:24,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:34:24,016 INFO L87 Difference]: Start difference. First operand 1134 states and 2521 transitions. Second operand 7 states. [2019-12-07 12:34:24,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:34:24,189 INFO L93 Difference]: Finished difference Result 3243 states and 7069 transitions. [2019-12-07 12:34:24,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 12:34:24,189 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-07 12:34:24,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:34:24,191 INFO L225 Difference]: With dead ends: 3243 [2019-12-07 12:34:24,191 INFO L226 Difference]: Without dead ends: 2194 [2019-12-07 12:34:24,192 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-07 12:34:24,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2194 states. [2019-12-07 12:34:24,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2194 to 1199. [2019-12-07 12:34:24,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1199 states. [2019-12-07 12:34:24,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 2650 transitions. [2019-12-07 12:34:24,245 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 2650 transitions. Word has length 52 [2019-12-07 12:34:24,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:34:24,245 INFO L462 AbstractCegarLoop]: Abstraction has 1199 states and 2650 transitions. [2019-12-07 12:34:24,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 12:34:24,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 2650 transitions. [2019-12-07 12:34:24,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 12:34:24,246 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:34:24,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, 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 12:34:24,246 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:34:24,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:34:24,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1616489678, now seen corresponding path program 3 times [2019-12-07 12:34:24,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:34:24,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059363844] [2019-12-07 12:34:24,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:34:24,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:34:24,309 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 12:34:24,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059363844] [2019-12-07 12:34:24,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:34:24,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:34:24,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510819544] [2019-12-07 12:34:24,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:34:24,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:34:24,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:34:24,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:34:24,310 INFO L87 Difference]: Start difference. First operand 1199 states and 2650 transitions. Second operand 4 states. [2019-12-07 12:34:24,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:34:24,353 INFO L93 Difference]: Finished difference Result 1448 states and 3172 transitions. [2019-12-07 12:34:24,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:34:24,353 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-07 12:34:24,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:34:24,355 INFO L225 Difference]: With dead ends: 1448 [2019-12-07 12:34:24,355 INFO L226 Difference]: Without dead ends: 1448 [2019-12-07 12:34:24,355 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 12:34:24,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1448 states. [2019-12-07 12:34:24,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1448 to 1108. [2019-12-07 12:34:24,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1108 states. [2019-12-07 12:34:24,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 2444 transitions. [2019-12-07 12:34:24,365 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 2444 transitions. Word has length 52 [2019-12-07 12:34:24,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:34:24,366 INFO L462 AbstractCegarLoop]: Abstraction has 1108 states and 2444 transitions. [2019-12-07 12:34:24,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:34:24,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 2444 transitions. [2019-12-07 12:34:24,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 12:34:24,367 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:34:24,367 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 12:34:24,367 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:34:24,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:34:24,367 INFO L82 PathProgramCache]: Analyzing trace with hash 238171223, now seen corresponding path program 1 times [2019-12-07 12:34:24,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:34:24,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765298652] [2019-12-07 12:34:24,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:34:24,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:34:24,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:34:24,445 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 12:34:24,445 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 12:34:24,448 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_47| 0 0))) (and (= v_~main$tmp_guard0~0_31 0) (= v_~x$r_buff1_thd1~0_165 0) (= 0 v_~x~0_148) (= v_~x$r_buff0_thd0~0_133 0) (= v_~x$r_buff0_thd1~0_227 0) (= 0 |v_ULTIMATE.start_main_~#t1713~0.offset_18|) (= |v_#valid_45| (store .cse0 |v_ULTIMATE.start_main_~#t1713~0.base_24| 1)) (= v_~weak$$choice2~0_120 0) (= |v_#NULL.offset_6| 0) (= v_~__unbuffered_p1_EBX~0_40 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1713~0.base_24| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1713~0.base_24|) |v_ULTIMATE.start_main_~#t1713~0.offset_18| 0)) |v_#memory_int_13|) (= 0 v_~x$read_delayed_var~0.base_7) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1713~0.base_24|) (= 0 v_~__unbuffered_cnt~0_63) (= v_~main$tmp_guard1~0_41 0) (= v_~y~0_147 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1713~0.base_24| 4)) (= 0 |v_#NULL.base_6|) (= v_~x$flush_delayed~0_31 0) (= 0 v_~x$read_delayed~0_7) (= v_~x$mem_tmp~0_24 0) (= 0 v_~x$w_buff1_used~0_507) (= 0 v_~weak$$choice0~0_22) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1713~0.base_24|)) (= v_~x$r_buff1_thd0~0_183 0) (= 0 v_~x$w_buff1~0_317) (= 0 v_~x$w_buff0~0_542) (= 0 v_~x$r_buff0_thd2~0_359) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$w_buff0_used~0_792) (= 0 v_~__unbuffered_p1_EAX~0_39) (= 0 v_~x$r_buff1_thd2~0_331) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_542, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_227, ULTIMATE.start_main_~#t1714~0.offset=|v_ULTIMATE.start_main_~#t1714~0.offset_14|, ~x$flush_delayed~0=v_~x$flush_delayed~0_31, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_165, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_41, ~x$mem_tmp~0=v_~x$mem_tmp~0_24, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_28|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_34|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_69|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_34|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ULTIMATE.start_main_~#t1714~0.base=|v_ULTIMATE.start_main_~#t1714~0.base_16|, #length=|v_#length_13|, ~y~0=v_~y~0_147, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_133, ULTIMATE.start_main_~#t1713~0.base=|v_ULTIMATE.start_main_~#t1713~0.base_24|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_317, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_507, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_331, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_183, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_359, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_792, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_37|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ULTIMATE.start_main_~#t1713~0.offset=|v_ULTIMATE.start_main_~#t1713~0.offset_18|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~weak$$choice2~0=v_~weak$$choice2~0_120, ~x~0=v_~x~0_148, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t1714~0.offset, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1714~0.base, #length, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_~#t1713~0.base, ~__unbuffered_p1_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t1713~0.offset, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 12:34:24,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L4-->L738: Formula: (and (= 1 v_~x$r_buff0_thd1~0_40) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_72 0)) (= v_~x$r_buff1_thd1~0_23 v_~x$r_buff0_thd1~0_41) (= v_~x$r_buff1_thd2~0_64 v_~x$r_buff0_thd2~0_110) (= v_~y~0_18 1) (= v_~x$r_buff1_thd0~0_37 v_~x$r_buff0_thd0~0_53)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_72, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_72, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_64, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_23, ~y~0=v_~y~0_18, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_37} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 12:34:24,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L797-1-->L799: Formula: (and (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1714~0.base_12|)) (= 0 |v_ULTIMATE.start_main_~#t1714~0.offset_10|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1714~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1714~0.base_12|) |v_ULTIMATE.start_main_~#t1714~0.offset_10| 1)) |v_#memory_int_9|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1714~0.base_12|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1714~0.base_12| 4)) (not (= |v_ULTIMATE.start_main_~#t1714~0.base_12| 0)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1714~0.base_12| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1714~0.offset=|v_ULTIMATE.start_main_~#t1714~0.offset_10|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1714~0.base=|v_ULTIMATE.start_main_~#t1714~0.base_12|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1714~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t1714~0.base, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 12:34:24,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L739-->L739-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In408465644 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In408465644 256) 0))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out408465644|) (not .cse1)) (and (= ~x$w_buff0_used~0_In408465644 |P0Thread1of1ForFork0_#t~ite5_Out408465644|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In408465644, ~x$w_buff0_used~0=~x$w_buff0_used~0_In408465644} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out408465644|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In408465644, ~x$w_buff0_used~0=~x$w_buff0_used~0_In408465644} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 12:34:24,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L763-->L763-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In35245333 256) 0))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite14_Out35245333| ~x$w_buff0~0_In35245333) (= |P1Thread1of1ForFork1_#t~ite14_Out35245333| |P1Thread1of1ForFork1_#t~ite15_Out35245333|) (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In35245333 256) 0))) (or (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In35245333 256))) (and .cse1 (= 0 (mod ~x$r_buff1_thd2~0_In35245333 256))) (= 0 (mod ~x$w_buff0_used~0_In35245333 256))))) (and (not .cse0) (= ~x$w_buff0~0_In35245333 |P1Thread1of1ForFork1_#t~ite15_Out35245333|) (= |P1Thread1of1ForFork1_#t~ite14_In35245333| |P1Thread1of1ForFork1_#t~ite14_Out35245333|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In35245333, ~x$w_buff1_used~0=~x$w_buff1_used~0_In35245333, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In35245333, ~weak$$choice2~0=~weak$$choice2~0_In35245333, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In35245333, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In35245333|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In35245333} OutVars{~x$w_buff0~0=~x$w_buff0~0_In35245333, ~x$w_buff1_used~0=~x$w_buff1_used~0_In35245333, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In35245333, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out35245333|, ~weak$$choice2~0=~weak$$choice2~0_In35245333, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In35245333, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out35245333|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In35245333} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 12:34:24,452 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L740-->L740-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1690742525 256))) (.cse2 (= (mod ~x$r_buff0_thd1~0_In-1690742525 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-1690742525 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1690742525 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-1690742525| ~x$w_buff1_used~0_In-1690742525) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork0_#t~ite6_Out-1690742525| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1690742525, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1690742525, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1690742525, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1690742525} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1690742525|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1690742525, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1690742525, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1690742525, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1690742525} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 12:34:24,452 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1531277962 256))) (.cse2 (= (mod ~x$r_buff0_thd1~0_In-1531277962 256) 0)) (.cse1 (= ~x$r_buff0_thd1~0_In-1531277962 ~x$r_buff0_thd1~0_Out-1531277962))) (or (and .cse0 .cse1) (and (not .cse2) (not .cse0) (= 0 ~x$r_buff0_thd1~0_Out-1531277962)) (and .cse2 .cse1))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1531277962, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1531277962} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out-1531277962, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1531277962|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1531277962} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-07 12:34:24,452 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L742-->L742-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In729116322 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In729116322 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In729116322 256))) (.cse3 (= (mod ~x$r_buff0_thd1~0_In729116322 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out729116322| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out729116322| ~x$r_buff1_thd1~0_In729116322)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In729116322, ~x$w_buff1_used~0=~x$w_buff1_used~0_In729116322, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In729116322, ~x$w_buff0_used~0=~x$w_buff0_used~0_In729116322} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In729116322, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out729116322|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In729116322, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In729116322, ~x$w_buff0_used~0=~x$w_buff0_used~0_In729116322} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 12:34:24,452 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L742-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~x$r_buff1_thd1~0_128 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_128} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-07 12:34:24,452 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L764-->L764-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In131135957 256)))) (or (and .cse0 (= ~x$w_buff1~0_In131135957 |P1Thread1of1ForFork1_#t~ite17_Out131135957|) (= |P1Thread1of1ForFork1_#t~ite18_Out131135957| |P1Thread1of1ForFork1_#t~ite17_Out131135957|) (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In131135957 256) 0))) (or (= (mod ~x$w_buff0_used~0_In131135957 256) 0) (and .cse1 (= (mod ~x$w_buff1_used~0_In131135957 256) 0)) (and (= 0 (mod ~x$r_buff1_thd2~0_In131135957 256)) .cse1)))) (and (= ~x$w_buff1~0_In131135957 |P1Thread1of1ForFork1_#t~ite18_Out131135957|) (= |P1Thread1of1ForFork1_#t~ite17_In131135957| |P1Thread1of1ForFork1_#t~ite17_Out131135957|) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In131135957, ~x$w_buff1_used~0=~x$w_buff1_used~0_In131135957, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In131135957, ~weak$$choice2~0=~weak$$choice2~0_In131135957, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In131135957, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In131135957|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In131135957} OutVars{P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out131135957|, ~x$w_buff1~0=~x$w_buff1~0_In131135957, ~x$w_buff1_used~0=~x$w_buff1_used~0_In131135957, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In131135957, ~weak$$choice2~0=~weak$$choice2~0_In131135957, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In131135957, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out131135957|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In131135957} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-07 12:34:24,453 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L765-->L765-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-596423444 256) 0))) (or (and (= ~x$w_buff0_used~0_In-596423444 |P1Thread1of1ForFork1_#t~ite21_Out-596423444|) (= |P1Thread1of1ForFork1_#t~ite20_In-596423444| |P1Thread1of1ForFork1_#t~ite20_Out-596423444|) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-596423444 256)))) (or (and (= (mod ~x$w_buff1_used~0_In-596423444 256) 0) .cse1) (= (mod ~x$w_buff0_used~0_In-596423444 256) 0) (and (= 0 (mod ~x$r_buff1_thd2~0_In-596423444 256)) .cse1))) (= |P1Thread1of1ForFork1_#t~ite20_Out-596423444| ~x$w_buff0_used~0_In-596423444) (= |P1Thread1of1ForFork1_#t~ite20_Out-596423444| |P1Thread1of1ForFork1_#t~ite21_Out-596423444|) .cse0))) InVars {P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-596423444|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-596423444, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-596423444, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-596423444, ~weak$$choice2~0=~weak$$choice2~0_In-596423444, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-596423444} OutVars{P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-596423444|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-596423444, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-596423444, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-596423444|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-596423444, ~weak$$choice2~0=~weak$$choice2~0_In-596423444, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-596423444} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 12:34:24,454 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L767-->L768: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~x$r_buff0_thd2~0_135 v_~x$r_buff0_thd2~0_134)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_135, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_27, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_12|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 12:34:24,454 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L768-->L768-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1001931267 256)))) (or (and (= ~x$r_buff1_thd2~0_In-1001931267 |P1Thread1of1ForFork1_#t~ite30_Out-1001931267|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite29_In-1001931267| |P1Thread1of1ForFork1_#t~ite29_Out-1001931267|)) (and (= |P1Thread1of1ForFork1_#t~ite29_Out-1001931267| |P1Thread1of1ForFork1_#t~ite30_Out-1001931267|) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1001931267 256)))) (or (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-1001931267 256))) (and (= 0 (mod ~x$r_buff1_thd2~0_In-1001931267 256)) .cse1) (= 0 (mod ~x$w_buff0_used~0_In-1001931267 256)))) (= |P1Thread1of1ForFork1_#t~ite29_Out-1001931267| ~x$r_buff1_thd2~0_In-1001931267)))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-1001931267|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1001931267, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1001931267, ~weak$$choice2~0=~weak$$choice2~0_In-1001931267, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1001931267, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1001931267} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-1001931267|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-1001931267|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1001931267, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1001931267, ~weak$$choice2~0=~weak$$choice2~0_In-1001931267, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1001931267, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1001931267} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 12:34:24,454 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L770-->L774: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_5 v_~x~0_14)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_7, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[~x$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31, ~x~0] because there is no mapped edge [2019-12-07 12:34:24,454 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L774-2-->L774-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-1862196979 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd2~0_In-1862196979 256) 0))) (or (and (or .cse0 .cse1) (= ~x~0_In-1862196979 |P1Thread1of1ForFork1_#t~ite32_Out-1862196979|)) (and (= ~x$w_buff1~0_In-1862196979 |P1Thread1of1ForFork1_#t~ite32_Out-1862196979|) (not .cse1) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1862196979, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1862196979, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1862196979, ~x~0=~x~0_In-1862196979} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-1862196979, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1862196979, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1862196979, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-1862196979|, ~x~0=~x~0_In-1862196979} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 12:34:24,455 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L774-4-->L775: Formula: (= v_~x~0_29 |v_P1Thread1of1ForFork1_#t~ite32_6|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_6|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_5|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_5|, ~x~0=v_~x~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-07 12:34:24,455 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L775-->L775-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1705681559 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-1705681559 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out-1705681559| 0)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In-1705681559 |P1Thread1of1ForFork1_#t~ite34_Out-1705681559|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1705681559, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1705681559} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1705681559|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1705681559, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1705681559} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 12:34:24,455 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-99152115 256))) (.cse0 (= (mod ~x$r_buff1_thd2~0_In-99152115 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In-99152115 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd2~0_In-99152115 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite35_Out-99152115| ~x$w_buff1_used~0_In-99152115) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-99152115|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-99152115, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-99152115, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-99152115, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-99152115} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-99152115, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-99152115, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-99152115|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-99152115, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-99152115} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 12:34:24,455 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-586579556 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-586579556 256)))) (or (and (= ~x$r_buff0_thd2~0_In-586579556 |P1Thread1of1ForFork1_#t~ite36_Out-586579556|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-586579556|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-586579556, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-586579556} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-586579556, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-586579556|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-586579556} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 12:34:24,456 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In-2112925162 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-2112925162 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-2112925162 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-2112925162 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite37_Out-2112925162| 0)) (and (= |P1Thread1of1ForFork1_#t~ite37_Out-2112925162| ~x$r_buff1_thd2~0_In-2112925162) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-2112925162, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2112925162, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2112925162, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2112925162} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-2112925162, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2112925162, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2112925162, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-2112925162|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2112925162} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 12:34:24,456 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L778-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_269 |v_P1Thread1of1ForFork1_#t~ite37_40|) (= (+ v_~__unbuffered_cnt~0_47 1) v_~__unbuffered_cnt~0_46) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_40|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_269, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_39|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 12:34:24,456 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= 0 (mod v_~x$r_buff0_thd0~0_64 256)) (= (mod v_~x$w_buff0_used~0_301 256) 0)) (not (= (mod v_~main$tmp_guard0~0_8 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_301} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_301} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 12:34:24,456 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-396303633 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-396303633 256)))) (or (and (= ~x~0_In-396303633 |ULTIMATE.start_main_#t~ite40_Out-396303633|) (or .cse0 .cse1)) (and (= ~x$w_buff1~0_In-396303633 |ULTIMATE.start_main_#t~ite40_Out-396303633|) (not .cse1) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-396303633, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-396303633, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-396303633, ~x~0=~x~0_In-396303633} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-396303633|, ~x$w_buff1~0=~x$w_buff1~0_In-396303633, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-396303633, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-396303633, ~x~0=~x~0_In-396303633} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 12:34:24,456 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L805-4-->L806: Formula: (= v_~x~0_46 |v_ULTIMATE.start_main_#t~ite40_13|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~x~0=v_~x~0_46} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x~0] because there is no mapped edge [2019-12-07 12:34:24,457 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L806-->L806-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-628483083 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-628483083 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite42_Out-628483083|) (not .cse0) (not .cse1)) (and (= ~x$w_buff0_used~0_In-628483083 |ULTIMATE.start_main_#t~ite42_Out-628483083|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-628483083, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-628483083} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-628483083, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-628483083|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-628483083} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 12:34:24,457 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L807-->L807-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-2099069821 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-2099069821 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-2099069821 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-2099069821 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite43_Out-2099069821| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite43_Out-2099069821| ~x$w_buff1_used~0_In-2099069821) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2099069821, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2099069821, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2099069821, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2099069821} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2099069821, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2099069821, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-2099069821|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2099069821, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2099069821} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 12:34:24,457 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L808-->L808-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In1931109068 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In1931109068 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out1931109068| ~x$r_buff0_thd0~0_In1931109068) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite44_Out1931109068| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1931109068, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1931109068} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1931109068, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1931109068|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1931109068} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 12:34:24,458 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L809-->L809-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In1060743024 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In1060743024 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In1060743024 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1060743024 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out1060743024| ~x$r_buff1_thd0~0_In1060743024) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite45_Out1060743024| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1060743024, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1060743024, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1060743024, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1060743024} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1060743024, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1060743024, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1060743024, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1060743024|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1060743024} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 12:34:24,458 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_27 0) (= v_~y~0_126 2) (= 2 v_~__unbuffered_p1_EAX~0_27))) 1 0)) 0 1) v_~main$tmp_guard1~0_20) (= v_~x$r_buff1_thd0~0_149 |v_ULTIMATE.start_main_#t~ite45_40|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= (mod v_~main$tmp_guard1~0_20 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~y~0=v_~y~0_126, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~y~0=v_~y~0_126, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_149, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 12:34:24,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:34:24 BasicIcfg [2019-12-07 12:34:24,496 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:34:24,496 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:34:24,496 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:34:24,496 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:34:24,497 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:34:15" (3/4) ... [2019-12-07 12:34:24,498 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 12:34:24,499 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_47| 0 0))) (and (= v_~main$tmp_guard0~0_31 0) (= v_~x$r_buff1_thd1~0_165 0) (= 0 v_~x~0_148) (= v_~x$r_buff0_thd0~0_133 0) (= v_~x$r_buff0_thd1~0_227 0) (= 0 |v_ULTIMATE.start_main_~#t1713~0.offset_18|) (= |v_#valid_45| (store .cse0 |v_ULTIMATE.start_main_~#t1713~0.base_24| 1)) (= v_~weak$$choice2~0_120 0) (= |v_#NULL.offset_6| 0) (= v_~__unbuffered_p1_EBX~0_40 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1713~0.base_24| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1713~0.base_24|) |v_ULTIMATE.start_main_~#t1713~0.offset_18| 0)) |v_#memory_int_13|) (= 0 v_~x$read_delayed_var~0.base_7) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1713~0.base_24|) (= 0 v_~__unbuffered_cnt~0_63) (= v_~main$tmp_guard1~0_41 0) (= v_~y~0_147 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1713~0.base_24| 4)) (= 0 |v_#NULL.base_6|) (= v_~x$flush_delayed~0_31 0) (= 0 v_~x$read_delayed~0_7) (= v_~x$mem_tmp~0_24 0) (= 0 v_~x$w_buff1_used~0_507) (= 0 v_~weak$$choice0~0_22) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1713~0.base_24|)) (= v_~x$r_buff1_thd0~0_183 0) (= 0 v_~x$w_buff1~0_317) (= 0 v_~x$w_buff0~0_542) (= 0 v_~x$r_buff0_thd2~0_359) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$w_buff0_used~0_792) (= 0 v_~__unbuffered_p1_EAX~0_39) (= 0 v_~x$r_buff1_thd2~0_331) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_542, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_227, ULTIMATE.start_main_~#t1714~0.offset=|v_ULTIMATE.start_main_~#t1714~0.offset_14|, ~x$flush_delayed~0=v_~x$flush_delayed~0_31, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_165, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_41, ~x$mem_tmp~0=v_~x$mem_tmp~0_24, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_28|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_34|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_69|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_34|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ULTIMATE.start_main_~#t1714~0.base=|v_ULTIMATE.start_main_~#t1714~0.base_16|, #length=|v_#length_13|, ~y~0=v_~y~0_147, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_133, ULTIMATE.start_main_~#t1713~0.base=|v_ULTIMATE.start_main_~#t1713~0.base_24|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_317, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_507, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_331, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_183, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_359, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_792, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_37|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ULTIMATE.start_main_~#t1713~0.offset=|v_ULTIMATE.start_main_~#t1713~0.offset_18|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~weak$$choice2~0=v_~weak$$choice2~0_120, ~x~0=v_~x~0_148, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t1714~0.offset, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1714~0.base, #length, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_~#t1713~0.base, ~__unbuffered_p1_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t1713~0.offset, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 12:34:24,499 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L4-->L738: Formula: (and (= 1 v_~x$r_buff0_thd1~0_40) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_72 0)) (= v_~x$r_buff1_thd1~0_23 v_~x$r_buff0_thd1~0_41) (= v_~x$r_buff1_thd2~0_64 v_~x$r_buff0_thd2~0_110) (= v_~y~0_18 1) (= v_~x$r_buff1_thd0~0_37 v_~x$r_buff0_thd0~0_53)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_72, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_72, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_64, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_23, ~y~0=v_~y~0_18, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_37} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 12:34:24,499 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L797-1-->L799: Formula: (and (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1714~0.base_12|)) (= 0 |v_ULTIMATE.start_main_~#t1714~0.offset_10|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1714~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1714~0.base_12|) |v_ULTIMATE.start_main_~#t1714~0.offset_10| 1)) |v_#memory_int_9|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1714~0.base_12|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1714~0.base_12| 4)) (not (= |v_ULTIMATE.start_main_~#t1714~0.base_12| 0)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1714~0.base_12| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1714~0.offset=|v_ULTIMATE.start_main_~#t1714~0.offset_10|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1714~0.base=|v_ULTIMATE.start_main_~#t1714~0.base_12|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1714~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t1714~0.base, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 12:34:24,500 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L739-->L739-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In408465644 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In408465644 256) 0))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out408465644|) (not .cse1)) (and (= ~x$w_buff0_used~0_In408465644 |P0Thread1of1ForFork0_#t~ite5_Out408465644|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In408465644, ~x$w_buff0_used~0=~x$w_buff0_used~0_In408465644} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out408465644|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In408465644, ~x$w_buff0_used~0=~x$w_buff0_used~0_In408465644} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 12:34:24,501 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L763-->L763-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In35245333 256) 0))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite14_Out35245333| ~x$w_buff0~0_In35245333) (= |P1Thread1of1ForFork1_#t~ite14_Out35245333| |P1Thread1of1ForFork1_#t~ite15_Out35245333|) (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In35245333 256) 0))) (or (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In35245333 256))) (and .cse1 (= 0 (mod ~x$r_buff1_thd2~0_In35245333 256))) (= 0 (mod ~x$w_buff0_used~0_In35245333 256))))) (and (not .cse0) (= ~x$w_buff0~0_In35245333 |P1Thread1of1ForFork1_#t~ite15_Out35245333|) (= |P1Thread1of1ForFork1_#t~ite14_In35245333| |P1Thread1of1ForFork1_#t~ite14_Out35245333|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In35245333, ~x$w_buff1_used~0=~x$w_buff1_used~0_In35245333, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In35245333, ~weak$$choice2~0=~weak$$choice2~0_In35245333, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In35245333, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In35245333|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In35245333} OutVars{~x$w_buff0~0=~x$w_buff0~0_In35245333, ~x$w_buff1_used~0=~x$w_buff1_used~0_In35245333, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In35245333, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out35245333|, ~weak$$choice2~0=~weak$$choice2~0_In35245333, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In35245333, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out35245333|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In35245333} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 12:34:24,501 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L740-->L740-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1690742525 256))) (.cse2 (= (mod ~x$r_buff0_thd1~0_In-1690742525 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-1690742525 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1690742525 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-1690742525| ~x$w_buff1_used~0_In-1690742525) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork0_#t~ite6_Out-1690742525| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1690742525, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1690742525, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1690742525, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1690742525} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1690742525|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1690742525, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1690742525, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1690742525, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1690742525} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 12:34:24,502 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1531277962 256))) (.cse2 (= (mod ~x$r_buff0_thd1~0_In-1531277962 256) 0)) (.cse1 (= ~x$r_buff0_thd1~0_In-1531277962 ~x$r_buff0_thd1~0_Out-1531277962))) (or (and .cse0 .cse1) (and (not .cse2) (not .cse0) (= 0 ~x$r_buff0_thd1~0_Out-1531277962)) (and .cse2 .cse1))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1531277962, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1531277962} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out-1531277962, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1531277962|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1531277962} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-07 12:34:24,502 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L742-->L742-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In729116322 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In729116322 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In729116322 256))) (.cse3 (= (mod ~x$r_buff0_thd1~0_In729116322 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out729116322| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out729116322| ~x$r_buff1_thd1~0_In729116322)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In729116322, ~x$w_buff1_used~0=~x$w_buff1_used~0_In729116322, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In729116322, ~x$w_buff0_used~0=~x$w_buff0_used~0_In729116322} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In729116322, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out729116322|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In729116322, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In729116322, ~x$w_buff0_used~0=~x$w_buff0_used~0_In729116322} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 12:34:24,502 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L742-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~x$r_buff1_thd1~0_128 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_128} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-07 12:34:24,502 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L764-->L764-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In131135957 256)))) (or (and .cse0 (= ~x$w_buff1~0_In131135957 |P1Thread1of1ForFork1_#t~ite17_Out131135957|) (= |P1Thread1of1ForFork1_#t~ite18_Out131135957| |P1Thread1of1ForFork1_#t~ite17_Out131135957|) (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In131135957 256) 0))) (or (= (mod ~x$w_buff0_used~0_In131135957 256) 0) (and .cse1 (= (mod ~x$w_buff1_used~0_In131135957 256) 0)) (and (= 0 (mod ~x$r_buff1_thd2~0_In131135957 256)) .cse1)))) (and (= ~x$w_buff1~0_In131135957 |P1Thread1of1ForFork1_#t~ite18_Out131135957|) (= |P1Thread1of1ForFork1_#t~ite17_In131135957| |P1Thread1of1ForFork1_#t~ite17_Out131135957|) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In131135957, ~x$w_buff1_used~0=~x$w_buff1_used~0_In131135957, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In131135957, ~weak$$choice2~0=~weak$$choice2~0_In131135957, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In131135957, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In131135957|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In131135957} OutVars{P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out131135957|, ~x$w_buff1~0=~x$w_buff1~0_In131135957, ~x$w_buff1_used~0=~x$w_buff1_used~0_In131135957, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In131135957, ~weak$$choice2~0=~weak$$choice2~0_In131135957, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In131135957, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out131135957|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In131135957} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-07 12:34:24,502 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L765-->L765-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-596423444 256) 0))) (or (and (= ~x$w_buff0_used~0_In-596423444 |P1Thread1of1ForFork1_#t~ite21_Out-596423444|) (= |P1Thread1of1ForFork1_#t~ite20_In-596423444| |P1Thread1of1ForFork1_#t~ite20_Out-596423444|) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-596423444 256)))) (or (and (= (mod ~x$w_buff1_used~0_In-596423444 256) 0) .cse1) (= (mod ~x$w_buff0_used~0_In-596423444 256) 0) (and (= 0 (mod ~x$r_buff1_thd2~0_In-596423444 256)) .cse1))) (= |P1Thread1of1ForFork1_#t~ite20_Out-596423444| ~x$w_buff0_used~0_In-596423444) (= |P1Thread1of1ForFork1_#t~ite20_Out-596423444| |P1Thread1of1ForFork1_#t~ite21_Out-596423444|) .cse0))) InVars {P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-596423444|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-596423444, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-596423444, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-596423444, ~weak$$choice2~0=~weak$$choice2~0_In-596423444, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-596423444} OutVars{P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-596423444|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-596423444, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-596423444, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-596423444|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-596423444, ~weak$$choice2~0=~weak$$choice2~0_In-596423444, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-596423444} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 12:34:24,503 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L767-->L768: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~x$r_buff0_thd2~0_135 v_~x$r_buff0_thd2~0_134)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_135, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_27, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_12|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 12:34:24,503 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L768-->L768-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1001931267 256)))) (or (and (= ~x$r_buff1_thd2~0_In-1001931267 |P1Thread1of1ForFork1_#t~ite30_Out-1001931267|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite29_In-1001931267| |P1Thread1of1ForFork1_#t~ite29_Out-1001931267|)) (and (= |P1Thread1of1ForFork1_#t~ite29_Out-1001931267| |P1Thread1of1ForFork1_#t~ite30_Out-1001931267|) .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1001931267 256)))) (or (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-1001931267 256))) (and (= 0 (mod ~x$r_buff1_thd2~0_In-1001931267 256)) .cse1) (= 0 (mod ~x$w_buff0_used~0_In-1001931267 256)))) (= |P1Thread1of1ForFork1_#t~ite29_Out-1001931267| ~x$r_buff1_thd2~0_In-1001931267)))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-1001931267|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1001931267, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1001931267, ~weak$$choice2~0=~weak$$choice2~0_In-1001931267, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1001931267, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1001931267} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-1001931267|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-1001931267|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1001931267, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1001931267, ~weak$$choice2~0=~weak$$choice2~0_In-1001931267, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1001931267, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1001931267} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 12:34:24,503 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L770-->L774: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_5 v_~x~0_14)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_7, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[~x$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31, ~x~0] because there is no mapped edge [2019-12-07 12:34:24,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L774-2-->L774-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-1862196979 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd2~0_In-1862196979 256) 0))) (or (and (or .cse0 .cse1) (= ~x~0_In-1862196979 |P1Thread1of1ForFork1_#t~ite32_Out-1862196979|)) (and (= ~x$w_buff1~0_In-1862196979 |P1Thread1of1ForFork1_#t~ite32_Out-1862196979|) (not .cse1) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1862196979, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1862196979, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1862196979, ~x~0=~x~0_In-1862196979} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-1862196979, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1862196979, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1862196979, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-1862196979|, ~x~0=~x~0_In-1862196979} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 12:34:24,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L774-4-->L775: Formula: (= v_~x~0_29 |v_P1Thread1of1ForFork1_#t~ite32_6|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_6|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_5|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_5|, ~x~0=v_~x~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-07 12:34:24,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L775-->L775-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1705681559 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-1705681559 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out-1705681559| 0)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In-1705681559 |P1Thread1of1ForFork1_#t~ite34_Out-1705681559|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1705681559, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1705681559} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1705681559|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1705681559, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1705681559} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 12:34:24,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-99152115 256))) (.cse0 (= (mod ~x$r_buff1_thd2~0_In-99152115 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In-99152115 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd2~0_In-99152115 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite35_Out-99152115| ~x$w_buff1_used~0_In-99152115) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-99152115|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-99152115, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-99152115, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-99152115, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-99152115} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-99152115, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-99152115, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-99152115|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-99152115, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-99152115} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 12:34:24,505 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-586579556 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-586579556 256)))) (or (and (= ~x$r_buff0_thd2~0_In-586579556 |P1Thread1of1ForFork1_#t~ite36_Out-586579556|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-586579556|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-586579556, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-586579556} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-586579556, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-586579556|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-586579556} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 12:34:24,505 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In-2112925162 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-2112925162 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-2112925162 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-2112925162 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite37_Out-2112925162| 0)) (and (= |P1Thread1of1ForFork1_#t~ite37_Out-2112925162| ~x$r_buff1_thd2~0_In-2112925162) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-2112925162, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2112925162, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2112925162, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2112925162} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-2112925162, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2112925162, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2112925162, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-2112925162|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2112925162} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 12:34:24,505 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L778-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_269 |v_P1Thread1of1ForFork1_#t~ite37_40|) (= (+ v_~__unbuffered_cnt~0_47 1) v_~__unbuffered_cnt~0_46) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_40|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_269, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_39|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 12:34:24,505 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= 0 (mod v_~x$r_buff0_thd0~0_64 256)) (= (mod v_~x$w_buff0_used~0_301 256) 0)) (not (= (mod v_~main$tmp_guard0~0_8 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_301} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_301} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 12:34:24,505 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In-396303633 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-396303633 256)))) (or (and (= ~x~0_In-396303633 |ULTIMATE.start_main_#t~ite40_Out-396303633|) (or .cse0 .cse1)) (and (= ~x$w_buff1~0_In-396303633 |ULTIMATE.start_main_#t~ite40_Out-396303633|) (not .cse1) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-396303633, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-396303633, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-396303633, ~x~0=~x~0_In-396303633} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-396303633|, ~x$w_buff1~0=~x$w_buff1~0_In-396303633, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-396303633, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-396303633, ~x~0=~x~0_In-396303633} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 12:34:24,505 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L805-4-->L806: Formula: (= v_~x~0_46 |v_ULTIMATE.start_main_#t~ite40_13|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~x~0=v_~x~0_46} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x~0] because there is no mapped edge [2019-12-07 12:34:24,506 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L806-->L806-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-628483083 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-628483083 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite42_Out-628483083|) (not .cse0) (not .cse1)) (and (= ~x$w_buff0_used~0_In-628483083 |ULTIMATE.start_main_#t~ite42_Out-628483083|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-628483083, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-628483083} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-628483083, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-628483083|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-628483083} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 12:34:24,506 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L807-->L807-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-2099069821 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-2099069821 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-2099069821 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-2099069821 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite43_Out-2099069821| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite43_Out-2099069821| ~x$w_buff1_used~0_In-2099069821) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2099069821, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2099069821, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2099069821, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2099069821} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2099069821, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2099069821, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-2099069821|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2099069821, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2099069821} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 12:34:24,506 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L808-->L808-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In1931109068 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In1931109068 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out1931109068| ~x$r_buff0_thd0~0_In1931109068) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite44_Out1931109068| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1931109068, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1931109068} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1931109068, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1931109068|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1931109068} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 12:34:24,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L809-->L809-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In1060743024 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In1060743024 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In1060743024 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1060743024 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out1060743024| ~x$r_buff1_thd0~0_In1060743024) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite45_Out1060743024| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1060743024, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1060743024, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1060743024, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1060743024} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1060743024, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1060743024, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1060743024, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1060743024|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1060743024} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 12:34:24,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_27 0) (= v_~y~0_126 2) (= 2 v_~__unbuffered_p1_EAX~0_27))) 1 0)) 0 1) v_~main$tmp_guard1~0_20) (= v_~x$r_buff1_thd0~0_149 |v_ULTIMATE.start_main_#t~ite45_40|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= (mod v_~main$tmp_guard1~0_20 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~y~0=v_~y~0_126, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~y~0=v_~y~0_126, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_149, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 12:34:24,555 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_c3906476-5e07-4717-a19f-54860f73c831/bin/utaipan/witness.graphml [2019-12-07 12:34:24,555 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:34:24,556 INFO L168 Benchmark]: Toolchain (without parser) took 9511.32 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 390.6 MB). Free memory was 936.0 MB in the beginning and 1.2 GB in the end (delta: -259.4 MB). Peak memory consumption was 131.2 MB. Max. memory is 11.5 GB. [2019-12-07 12:34:24,557 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:34:24,557 INFO L168 Benchmark]: CACSL2BoogieTranslator took 441.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 936.0 MB in the beginning and 1.1 GB in the end (delta: -163.3 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 12:34:24,557 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.24 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 12:34:24,557 INFO L168 Benchmark]: Boogie Preprocessor took 32.32 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:34:24,558 INFO L168 Benchmark]: RCFGBuilder took 389.10 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: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 11.5 GB. [2019-12-07 12:34:24,558 INFO L168 Benchmark]: TraceAbstraction took 8532.41 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 261.6 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -165.6 MB). Peak memory consumption was 96.0 MB. Max. memory is 11.5 GB. [2019-12-07 12:34:24,558 INFO L168 Benchmark]: Witness Printer took 59.17 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2019-12-07 12:34:24,560 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 441.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 936.0 MB in the beginning and 1.1 GB in the end (delta: -163.3 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.24 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.32 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 389.10 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: 50.9 MB). Peak memory consumption was 50.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8532.41 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 261.6 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -165.6 MB). Peak memory consumption was 96.0 MB. Max. memory is 11.5 GB. * Witness Printer took 59.17 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.0s, 147 ProgramPointsBefore, 79 ProgramPointsAfterwards, 181 TransitionsBefore, 90 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 12 FixpointIterations, 29 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 26 ChoiceCompositions, 4894 VarBasedMoverChecksPositive, 354 VarBasedMoverChecksNegative, 269 SemBasedMoverChecksPositive, 191 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.0s, 0 MoverChecksTotal, 76691 CheckedPairsTotal, 108 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t1713, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L724] 1 x$w_buff1 = x$w_buff0 [L725] 1 x$w_buff0 = 1 [L726] 1 x$w_buff1_used = x$w_buff0_used [L727] 1 x$w_buff0_used = (_Bool)1 [L738] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] FCALL, FORK 0 pthread_create(&t1714, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L752] 2 y = 2 [L755] 2 __unbuffered_p1_EAX = y [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 x$flush_delayed = weak$$choice2 [L761] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L762] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L762] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L763] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L739] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L740] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L764] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L765] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L766] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L768] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L774] 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L776] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L777] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L806] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L807] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L808] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 8.4s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1735 SDtfs, 2000 SDslu, 3700 SDs, 0 SdLazy, 2141 SolverSat, 143 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 15 SyntacticMatches, 10 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12234occurred 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.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 10383 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 375 NumberOfCodeBlocks, 375 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 310 ConstructedInterpolants, 0 QuantifiedInterpolants, 49010 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...