./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe022_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_1ea26e94-3b69-409b-99ee-924d7de7aa86/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_1ea26e94-3b69-409b-99ee-924d7de7aa86/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1ea26e94-3b69-409b-99ee-924d7de7aa86/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1ea26e94-3b69-409b-99ee-924d7de7aa86/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe022_rmo.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_1ea26e94-3b69-409b-99ee-924d7de7aa86/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1ea26e94-3b69-409b-99ee-924d7de7aa86/bin/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fac85231f5e7b09e0680a474d412fb9232e1875e ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 14:08:23,427 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:08:23,429 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:08:23,436 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:08:23,437 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:08:23,437 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:08:23,438 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:08:23,440 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:08:23,441 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:08:23,442 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:08:23,443 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:08:23,444 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:08:23,444 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:08:23,444 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:08:23,445 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:08:23,446 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:08:23,447 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:08:23,447 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:08:23,449 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:08:23,451 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:08:23,452 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:08:23,453 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:08:23,454 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:08:23,454 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:08:23,456 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:08:23,457 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:08:23,457 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:08:23,457 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:08:23,457 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:08:23,458 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:08:23,458 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:08:23,459 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:08:23,459 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:08:23,460 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:08:23,460 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:08:23,460 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:08:23,461 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:08:23,461 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:08:23,461 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:08:23,462 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:08:23,462 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:08:23,462 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1ea26e94-3b69-409b-99ee-924d7de7aa86/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 14:08:23,472 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:08:23,472 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:08:23,473 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 14:08:23,473 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 14:08:23,473 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 14:08:23,473 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:08:23,474 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:08:23,474 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:08:23,474 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:08:23,474 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:08:23,474 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 14:08:23,474 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:08:23,474 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 14:08:23,474 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:08:23,475 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 14:08:23,475 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:08:23,475 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 14:08:23,475 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:08:23,475 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 14:08:23,475 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:08:23,475 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:08:23,475 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:08:23,476 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:08:23,476 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:08:23,476 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 14:08:23,476 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 14:08:23,476 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 14:08:23,476 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 14:08:23,476 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:08:23,476 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_1ea26e94-3b69-409b-99ee-924d7de7aa86/bin/uautomizer 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 -> Automizer 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 -> fac85231f5e7b09e0680a474d412fb9232e1875e [2019-12-07 14:08:23,580 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:08:23,590 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:08:23,593 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:08:23,594 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:08:23,595 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:08:23,595 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1ea26e94-3b69-409b-99ee-924d7de7aa86/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe022_rmo.oepc.i [2019-12-07 14:08:23,636 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1ea26e94-3b69-409b-99ee-924d7de7aa86/bin/uautomizer/data/270f992a9/8c796b75153349309a316a2383211fde/FLAG4c6557082 [2019-12-07 14:08:24,048 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:08:24,048 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1ea26e94-3b69-409b-99ee-924d7de7aa86/sv-benchmarks/c/pthread-wmm/safe022_rmo.oepc.i [2019-12-07 14:08:24,058 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1ea26e94-3b69-409b-99ee-924d7de7aa86/bin/uautomizer/data/270f992a9/8c796b75153349309a316a2383211fde/FLAG4c6557082 [2019-12-07 14:08:24,066 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1ea26e94-3b69-409b-99ee-924d7de7aa86/bin/uautomizer/data/270f992a9/8c796b75153349309a316a2383211fde [2019-12-07 14:08:24,068 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:08:24,069 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:08:24,070 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:08:24,070 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:08:24,072 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:08:24,072 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:08:24" (1/1) ... [2019-12-07 14:08:24,074 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75544c05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:08:24, skipping insertion in model container [2019-12-07 14:08:24,075 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:08:24" (1/1) ... [2019-12-07 14:08:24,079 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:08:24,106 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:08:24,365 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:08:24,372 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:08:24,412 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:08:24,455 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:08:24,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:08:24 WrapperNode [2019-12-07 14:08:24,456 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:08:24,456 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:08:24,456 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:08:24,456 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:08:24,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:08:24" (1/1) ... [2019-12-07 14:08:24,473 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:08:24" (1/1) ... [2019-12-07 14:08:24,491 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:08:24,491 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:08:24,491 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:08:24,491 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:08:24,498 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:08:24" (1/1) ... [2019-12-07 14:08:24,498 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:08:24" (1/1) ... [2019-12-07 14:08:24,501 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:08:24" (1/1) ... [2019-12-07 14:08:24,501 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:08:24" (1/1) ... [2019-12-07 14:08:24,508 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:08:24" (1/1) ... [2019-12-07 14:08:24,510 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:08:24" (1/1) ... [2019-12-07 14:08:24,512 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:08:24" (1/1) ... [2019-12-07 14:08:24,515 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:08:24,515 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:08:24,515 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:08:24,516 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:08:24,516 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:08:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1ea26e94-3b69-409b-99ee-924d7de7aa86/bin/uautomizer/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 14:08:24,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 14:08:24,555 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 14:08:24,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 14:08:24,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 14:08:24,555 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 14:08:24,555 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 14:08:24,555 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 14:08:24,556 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 14:08:24,556 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 14:08:24,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:08:24,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:08:24,557 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 14:08:24,892 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:08:24,892 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 14:08:24,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:08:24 BoogieIcfgContainer [2019-12-07 14:08:24,893 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:08:24,894 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 14:08:24,894 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 14:08:24,896 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 14:08:24,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 02:08:24" (1/3) ... [2019-12-07 14:08:24,896 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43e2a6fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:08:24, skipping insertion in model container [2019-12-07 14:08:24,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:08:24" (2/3) ... [2019-12-07 14:08:24,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43e2a6fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:08:24, skipping insertion in model container [2019-12-07 14:08:24,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:08:24" (3/3) ... [2019-12-07 14:08:24,898 INFO L109 eAbstractionObserver]: Analyzing ICFG safe022_rmo.oepc.i [2019-12-07 14:08:24,904 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 14:08:24,904 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 14:08:24,908 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 14:08:24,909 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 14:08:24,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,931 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,931 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,931 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,931 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,932 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,932 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,932 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,936 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,936 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:08:24,958 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 14:08:24,970 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 14:08:24,971 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 14:08:24,971 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 14:08:24,971 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:08:24,971 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:08:24,971 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 14:08:24,971 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:08:24,971 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 14:08:24,981 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-07 14:08:24,983 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-07 14:08:25,031 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-07 14:08:25,031 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 14:08:25,039 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 9. Compared 569 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 14:08:25,050 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-07 14:08:25,075 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-07 14:08:25,075 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 14:08:25,078 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 9. Compared 569 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 14:08:25,089 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-07 14:08:25,090 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 14:08:27,658 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-07 14:08:27,766 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49472 [2019-12-07 14:08:27,766 INFO L214 etLargeBlockEncoding]: Total number of compositions: 106 [2019-12-07 14:08:27,768 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 84 transitions [2019-12-07 14:08:28,099 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8220 states. [2019-12-07 14:08:28,101 INFO L276 IsEmpty]: Start isEmpty. Operand 8220 states. [2019-12-07 14:08:28,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 14:08:28,105 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:08:28,105 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 14:08:28,106 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:08:28,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:08:28,110 INFO L82 PathProgramCache]: Analyzing trace with hash 795105, now seen corresponding path program 1 times [2019-12-07 14:08:28,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:08:28,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209407634] [2019-12-07 14:08:28,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:08:28,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:08:28,244 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 14:08:28,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209407634] [2019-12-07 14:08:28,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:08:28,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 14:08:28,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926138022] [2019-12-07 14:08:28,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:08:28,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:08:28,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:08:28,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:08:28,260 INFO L87 Difference]: Start difference. First operand 8220 states. Second operand 3 states. [2019-12-07 14:08:28,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:08:28,428 INFO L93 Difference]: Finished difference Result 8074 states and 26190 transitions. [2019-12-07 14:08:28,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:08:28,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 14:08:28,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:08:28,485 INFO L225 Difference]: With dead ends: 8074 [2019-12-07 14:08:28,485 INFO L226 Difference]: Without dead ends: 7606 [2019-12-07 14:08:28,486 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 14:08:28,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7606 states. [2019-12-07 14:08:28,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7606 to 7606. [2019-12-07 14:08:28,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7606 states. [2019-12-07 14:08:28,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7606 states to 7606 states and 24627 transitions. [2019-12-07 14:08:28,741 INFO L78 Accepts]: Start accepts. Automaton has 7606 states and 24627 transitions. Word has length 3 [2019-12-07 14:08:28,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:08:28,741 INFO L462 AbstractCegarLoop]: Abstraction has 7606 states and 24627 transitions. [2019-12-07 14:08:28,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:08:28,741 INFO L276 IsEmpty]: Start isEmpty. Operand 7606 states and 24627 transitions. [2019-12-07 14:08:28,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 14:08:28,744 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:08:28,744 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:08:28,744 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:08:28,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:08:28,744 INFO L82 PathProgramCache]: Analyzing trace with hash 884428319, now seen corresponding path program 1 times [2019-12-07 14:08:28,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:08:28,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158021836] [2019-12-07 14:08:28,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:08:28,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:08:28,805 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 14:08:28,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158021836] [2019-12-07 14:08:28,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:08:28,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:08:28,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196827291] [2019-12-07 14:08:28,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:08:28,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:08:28,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:08:28,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:08:28,808 INFO L87 Difference]: Start difference. First operand 7606 states and 24627 transitions. Second operand 4 states. [2019-12-07 14:08:29,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:08:29,064 INFO L93 Difference]: Finished difference Result 11630 states and 36033 transitions. [2019-12-07 14:08:29,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:08:29,065 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 14:08:29,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:08:29,128 INFO L225 Difference]: With dead ends: 11630 [2019-12-07 14:08:29,129 INFO L226 Difference]: Without dead ends: 11623 [2019-12-07 14:08:29,129 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 14:08:29,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11623 states. [2019-12-07 14:08:29,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11623 to 10415. [2019-12-07 14:08:29,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10415 states. [2019-12-07 14:08:29,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10415 states to 10415 states and 32855 transitions. [2019-12-07 14:08:29,459 INFO L78 Accepts]: Start accepts. Automaton has 10415 states and 32855 transitions. Word has length 11 [2019-12-07 14:08:29,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:08:29,459 INFO L462 AbstractCegarLoop]: Abstraction has 10415 states and 32855 transitions. [2019-12-07 14:08:29,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:08:29,459 INFO L276 IsEmpty]: Start isEmpty. Operand 10415 states and 32855 transitions. [2019-12-07 14:08:29,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 14:08:29,464 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:08:29,464 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:08:29,464 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:08:29,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:08:29,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1398507206, now seen corresponding path program 1 times [2019-12-07 14:08:29,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:08:29,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323387492] [2019-12-07 14:08:29,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:08:29,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:08:29,519 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 14:08:29,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323387492] [2019-12-07 14:08:29,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:08:29,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:08:29,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925453701] [2019-12-07 14:08:29,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:08:29,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:08:29,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:08:29,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:08:29,521 INFO L87 Difference]: Start difference. First operand 10415 states and 32855 transitions. Second operand 5 states. [2019-12-07 14:08:29,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:08:29,726 INFO L93 Difference]: Finished difference Result 14471 states and 44955 transitions. [2019-12-07 14:08:29,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:08:29,726 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 14:08:29,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:08:29,767 INFO L225 Difference]: With dead ends: 14471 [2019-12-07 14:08:29,768 INFO L226 Difference]: Without dead ends: 14471 [2019-12-07 14:08:29,768 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 14:08:29,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14471 states. [2019-12-07 14:08:29,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14471 to 11360. [2019-12-07 14:08:29,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11360 states. [2019-12-07 14:08:30,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11360 states to 11360 states and 35793 transitions. [2019-12-07 14:08:30,012 INFO L78 Accepts]: Start accepts. Automaton has 11360 states and 35793 transitions. Word has length 14 [2019-12-07 14:08:30,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:08:30,013 INFO L462 AbstractCegarLoop]: Abstraction has 11360 states and 35793 transitions. [2019-12-07 14:08:30,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:08:30,013 INFO L276 IsEmpty]: Start isEmpty. Operand 11360 states and 35793 transitions. [2019-12-07 14:08:30,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 14:08:30,016 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:08:30,016 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:08:30,016 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:08:30,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:08:30,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1120571574, now seen corresponding path program 1 times [2019-12-07 14:08:30,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:08:30,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231424685] [2019-12-07 14:08:30,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:08:30,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:08:30,059 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 14:08:30,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231424685] [2019-12-07 14:08:30,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:08:30,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 14:08:30,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116997282] [2019-12-07 14:08:30,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:08:30,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:08:30,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:08:30,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:08:30,061 INFO L87 Difference]: Start difference. First operand 11360 states and 35793 transitions. Second operand 3 states. [2019-12-07 14:08:30,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:08:30,096 INFO L93 Difference]: Finished difference Result 11335 states and 35719 transitions. [2019-12-07 14:08:30,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:08:30,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 14:08:30,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:08:30,116 INFO L225 Difference]: With dead ends: 11335 [2019-12-07 14:08:30,116 INFO L226 Difference]: Without dead ends: 11335 [2019-12-07 14:08:30,117 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 14:08:30,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11335 states. [2019-12-07 14:08:30,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11335 to 11335. [2019-12-07 14:08:30,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11335 states. [2019-12-07 14:08:30,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11335 states to 11335 states and 35719 transitions. [2019-12-07 14:08:30,328 INFO L78 Accepts]: Start accepts. Automaton has 11335 states and 35719 transitions. Word has length 16 [2019-12-07 14:08:30,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:08:30,329 INFO L462 AbstractCegarLoop]: Abstraction has 11335 states and 35719 transitions. [2019-12-07 14:08:30,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:08:30,329 INFO L276 IsEmpty]: Start isEmpty. Operand 11335 states and 35719 transitions. [2019-12-07 14:08:30,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 14:08:30,331 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:08:30,331 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:08:30,331 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:08:30,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:08:30,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1732892148, now seen corresponding path program 1 times [2019-12-07 14:08:30,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:08:30,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251875246] [2019-12-07 14:08:30,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:08:30,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:08:30,373 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 14:08:30,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251875246] [2019-12-07 14:08:30,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:08:30,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:08:30,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937226770] [2019-12-07 14:08:30,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:08:30,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:08:30,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:08:30,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:08:30,374 INFO L87 Difference]: Start difference. First operand 11335 states and 35719 transitions. Second operand 3 states. [2019-12-07 14:08:30,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:08:30,409 INFO L93 Difference]: Finished difference Result 10725 states and 33262 transitions. [2019-12-07 14:08:30,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:08:30,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 14:08:30,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:08:30,424 INFO L225 Difference]: With dead ends: 10725 [2019-12-07 14:08:30,424 INFO L226 Difference]: Without dead ends: 10725 [2019-12-07 14:08:30,425 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 14:08:30,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10725 states. [2019-12-07 14:08:30,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10725 to 10645. [2019-12-07 14:08:30,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10645 states. [2019-12-07 14:08:30,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10645 states to 10645 states and 33030 transitions. [2019-12-07 14:08:30,590 INFO L78 Accepts]: Start accepts. Automaton has 10645 states and 33030 transitions. Word has length 17 [2019-12-07 14:08:30,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:08:30,590 INFO L462 AbstractCegarLoop]: Abstraction has 10645 states and 33030 transitions. [2019-12-07 14:08:30,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:08:30,590 INFO L276 IsEmpty]: Start isEmpty. Operand 10645 states and 33030 transitions. [2019-12-07 14:08:30,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 14:08:30,592 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:08:30,592 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:08:30,593 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:08:30,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:08:30,593 INFO L82 PathProgramCache]: Analyzing trace with hash -680515989, now seen corresponding path program 1 times [2019-12-07 14:08:30,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:08:30,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375194184] [2019-12-07 14:08:30,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:08:30,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:08:30,631 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 14:08:30,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375194184] [2019-12-07 14:08:30,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:08:30,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:08:30,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985829373] [2019-12-07 14:08:30,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:08:30,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:08:30,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:08:30,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:08:30,632 INFO L87 Difference]: Start difference. First operand 10645 states and 33030 transitions. Second operand 4 states. [2019-12-07 14:08:30,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:08:30,686 INFO L93 Difference]: Finished difference Result 17458 states and 54315 transitions. [2019-12-07 14:08:30,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:08:30,687 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-07 14:08:30,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:08:30,697 INFO L225 Difference]: With dead ends: 17458 [2019-12-07 14:08:30,697 INFO L226 Difference]: Without dead ends: 8732 [2019-12-07 14:08:30,697 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:08:30,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8732 states. [2019-12-07 14:08:30,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8732 to 8732. [2019-12-07 14:08:30,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8732 states. [2019-12-07 14:08:30,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8732 states to 8732 states and 26564 transitions. [2019-12-07 14:08:30,849 INFO L78 Accepts]: Start accepts. Automaton has 8732 states and 26564 transitions. Word has length 17 [2019-12-07 14:08:30,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:08:30,849 INFO L462 AbstractCegarLoop]: Abstraction has 8732 states and 26564 transitions. [2019-12-07 14:08:30,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:08:30,849 INFO L276 IsEmpty]: Start isEmpty. Operand 8732 states and 26564 transitions. [2019-12-07 14:08:30,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 14:08:30,851 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:08:30,851 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:08:30,852 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:08:30,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:08:30,852 INFO L82 PathProgramCache]: Analyzing trace with hash 800753806, now seen corresponding path program 1 times [2019-12-07 14:08:30,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:08:30,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632103382] [2019-12-07 14:08:30,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:08:30,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:08:30,940 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 14:08:30,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632103382] [2019-12-07 14:08:30,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:08:30,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:08:30,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995619558] [2019-12-07 14:08:30,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:08:30,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:08:30,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:08:30,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:08:30,942 INFO L87 Difference]: Start difference. First operand 8732 states and 26564 transitions. Second operand 4 states. [2019-12-07 14:08:30,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:08:30,962 INFO L93 Difference]: Finished difference Result 1587 states and 3865 transitions. [2019-12-07 14:08:30,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:08:30,963 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 14:08:30,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:08:30,964 INFO L225 Difference]: With dead ends: 1587 [2019-12-07 14:08:30,964 INFO L226 Difference]: Without dead ends: 1155 [2019-12-07 14:08:30,965 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 14:08:30,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2019-12-07 14:08:30,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 1155. [2019-12-07 14:08:30,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1155 states. [2019-12-07 14:08:30,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 2511 transitions. [2019-12-07 14:08:30,978 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 2511 transitions. Word has length 19 [2019-12-07 14:08:30,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:08:30,978 INFO L462 AbstractCegarLoop]: Abstraction has 1155 states and 2511 transitions. [2019-12-07 14:08:30,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:08:30,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 2511 transitions. [2019-12-07 14:08:30,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 14:08:30,979 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:08:30,979 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] [2019-12-07 14:08:30,979 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:08:30,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:08:30,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1297290495, now seen corresponding path program 1 times [2019-12-07 14:08:30,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:08:30,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574419986] [2019-12-07 14:08:30,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:08:30,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:08:31,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:08:31,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574419986] [2019-12-07 14:08:31,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:08:31,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:08:31,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662998520] [2019-12-07 14:08:31,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:08:31,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:08:31,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:08:31,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:08:31,030 INFO L87 Difference]: Start difference. First operand 1155 states and 2511 transitions. Second operand 6 states. [2019-12-07 14:08:31,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:08:31,160 INFO L93 Difference]: Finished difference Result 1173 states and 2521 transitions. [2019-12-07 14:08:31,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 14:08:31,161 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-07 14:08:31,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:08:31,161 INFO L225 Difference]: With dead ends: 1173 [2019-12-07 14:08:31,162 INFO L226 Difference]: Without dead ends: 1121 [2019-12-07 14:08:31,162 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 14:08:31,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2019-12-07 14:08:31,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1100. [2019-12-07 14:08:31,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1100 states. [2019-12-07 14:08:31,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 1100 states and 2394 transitions. [2019-12-07 14:08:31,174 INFO L78 Accepts]: Start accepts. Automaton has 1100 states and 2394 transitions. Word has length 24 [2019-12-07 14:08:31,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:08:31,174 INFO L462 AbstractCegarLoop]: Abstraction has 1100 states and 2394 transitions. [2019-12-07 14:08:31,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:08:31,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 2394 transitions. [2019-12-07 14:08:31,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 14:08:31,175 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:08:31,175 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 14:08:31,175 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:08:31,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:08:31,175 INFO L82 PathProgramCache]: Analyzing trace with hash 747998845, now seen corresponding path program 1 times [2019-12-07 14:08:31,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:08:31,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451767543] [2019-12-07 14:08:31,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:08:31,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:08:31,235 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 14:08:31,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451767543] [2019-12-07 14:08:31,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:08:31,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:08:31,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421786889] [2019-12-07 14:08:31,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:08:31,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:08:31,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:08:31,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:08:31,236 INFO L87 Difference]: Start difference. First operand 1100 states and 2394 transitions. Second operand 5 states. [2019-12-07 14:08:31,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:08:31,265 INFO L93 Difference]: Finished difference Result 556 states and 1184 transitions. [2019-12-07 14:08:31,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:08:31,265 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-07 14:08:31,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:08:31,266 INFO L225 Difference]: With dead ends: 556 [2019-12-07 14:08:31,266 INFO L226 Difference]: Without dead ends: 471 [2019-12-07 14:08:31,266 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 14:08:31,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2019-12-07 14:08:31,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 471. [2019-12-07 14:08:31,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2019-12-07 14:08:31,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 1036 transitions. [2019-12-07 14:08:31,271 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 1036 transitions. Word has length 28 [2019-12-07 14:08:31,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:08:31,271 INFO L462 AbstractCegarLoop]: Abstraction has 471 states and 1036 transitions. [2019-12-07 14:08:31,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:08:31,271 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 1036 transitions. [2019-12-07 14:08:31,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 14:08:31,273 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:08:31,273 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] [2019-12-07 14:08:31,273 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:08:31,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:08:31,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1382412251, now seen corresponding path program 1 times [2019-12-07 14:08:31,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:08:31,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504450043] [2019-12-07 14:08:31,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:08:31,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:08:31,346 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 14:08:31,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504450043] [2019-12-07 14:08:31,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:08:31,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:08:31,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114968770] [2019-12-07 14:08:31,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:08:31,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:08:31,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:08:31,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:08:31,348 INFO L87 Difference]: Start difference. First operand 471 states and 1036 transitions. Second operand 5 states. [2019-12-07 14:08:31,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:08:31,592 INFO L93 Difference]: Finished difference Result 869 states and 1839 transitions. [2019-12-07 14:08:31,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:08:31,592 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-12-07 14:08:31,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:08:31,593 INFO L225 Difference]: With dead ends: 869 [2019-12-07 14:08:31,593 INFO L226 Difference]: Without dead ends: 869 [2019-12-07 14:08:31,593 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:08:31,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2019-12-07 14:08:31,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 720. [2019-12-07 14:08:31,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2019-12-07 14:08:31,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1564 transitions. [2019-12-07 14:08:31,601 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1564 transitions. Word has length 51 [2019-12-07 14:08:31,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:08:31,601 INFO L462 AbstractCegarLoop]: Abstraction has 720 states and 1564 transitions. [2019-12-07 14:08:31,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:08:31,601 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1564 transitions. [2019-12-07 14:08:31,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 14:08:31,603 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:08:31,603 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] [2019-12-07 14:08:31,603 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:08:31,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:08:31,604 INFO L82 PathProgramCache]: Analyzing trace with hash -544860975, now seen corresponding path program 2 times [2019-12-07 14:08:31,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:08:31,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867608564] [2019-12-07 14:08:31,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:08:31,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:08:31,658 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 14:08:31,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867608564] [2019-12-07 14:08:31,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:08:31,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:08:31,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662654518] [2019-12-07 14:08:31,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:08:31,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:08:31,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:08:31,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:08:31,660 INFO L87 Difference]: Start difference. First operand 720 states and 1564 transitions. Second operand 3 states. [2019-12-07 14:08:31,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:08:31,701 INFO L93 Difference]: Finished difference Result 928 states and 2008 transitions. [2019-12-07 14:08:31,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:08:31,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-07 14:08:31,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:08:31,702 INFO L225 Difference]: With dead ends: 928 [2019-12-07 14:08:31,702 INFO L226 Difference]: Without dead ends: 928 [2019-12-07 14:08:31,703 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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 14:08:31,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2019-12-07 14:08:31,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 759. [2019-12-07 14:08:31,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2019-12-07 14:08:31,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1666 transitions. [2019-12-07 14:08:31,713 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1666 transitions. Word has length 51 [2019-12-07 14:08:31,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:08:31,713 INFO L462 AbstractCegarLoop]: Abstraction has 759 states and 1666 transitions. [2019-12-07 14:08:31,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:08:31,714 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1666 transitions. [2019-12-07 14:08:31,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 14:08:31,715 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:08:31,715 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 14:08:31,715 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:08:31,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:08:31,716 INFO L82 PathProgramCache]: Analyzing trace with hash 2120720198, now seen corresponding path program 1 times [2019-12-07 14:08:31,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:08:31,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721031177] [2019-12-07 14:08:31,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:08:31,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:08:31,957 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 14:08:31,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721031177] [2019-12-07 14:08:31,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:08:31,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 14:08:31,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548422616] [2019-12-07 14:08:31,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 14:08:31,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:08:31,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 14:08:31,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-12-07 14:08:31,959 INFO L87 Difference]: Start difference. First operand 759 states and 1666 transitions. Second operand 13 states. [2019-12-07 14:08:32,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:08:32,819 INFO L93 Difference]: Finished difference Result 1086 states and 2309 transitions. [2019-12-07 14:08:32,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 14:08:32,820 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2019-12-07 14:08:32,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:08:32,821 INFO L225 Difference]: With dead ends: 1086 [2019-12-07 14:08:32,821 INFO L226 Difference]: Without dead ends: 865 [2019-12-07 14:08:32,821 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=667, Unknown=0, NotChecked=0, Total=812 [2019-12-07 14:08:32,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2019-12-07 14:08:32,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 790. [2019-12-07 14:08:32,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-12-07 14:08:32,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1740 transitions. [2019-12-07 14:08:32,828 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1740 transitions. Word has length 52 [2019-12-07 14:08:32,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:08:32,828 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1740 transitions. [2019-12-07 14:08:32,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 14:08:32,828 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1740 transitions. [2019-12-07 14:08:32,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 14:08:32,829 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:08:32,829 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 14:08:32,829 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:08:32,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:08:32,829 INFO L82 PathProgramCache]: Analyzing trace with hash 925896582, now seen corresponding path program 2 times [2019-12-07 14:08:32,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:08:32,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544208412] [2019-12-07 14:08:32,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:08:32,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:08:33,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:08:33,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544208412] [2019-12-07 14:08:33,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:08:33,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 14:08:33,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149928296] [2019-12-07 14:08:33,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 14:08:33,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:08:33,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 14:08:33,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-07 14:08:33,058 INFO L87 Difference]: Start difference. First operand 790 states and 1740 transitions. Second operand 12 states. [2019-12-07 14:08:34,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:08:34,300 INFO L93 Difference]: Finished difference Result 1139 states and 2440 transitions. [2019-12-07 14:08:34,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 14:08:34,301 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 52 [2019-12-07 14:08:34,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:08:34,302 INFO L225 Difference]: With dead ends: 1139 [2019-12-07 14:08:34,302 INFO L226 Difference]: Without dead ends: 828 [2019-12-07 14:08:34,302 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2019-12-07 14:08:34,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2019-12-07 14:08:34,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 828. [2019-12-07 14:08:34,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2019-12-07 14:08:34,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1812 transitions. [2019-12-07 14:08:34,309 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1812 transitions. Word has length 52 [2019-12-07 14:08:34,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:08:34,309 INFO L462 AbstractCegarLoop]: Abstraction has 828 states and 1812 transitions. [2019-12-07 14:08:34,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 14:08:34,310 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1812 transitions. [2019-12-07 14:08:34,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 14:08:34,311 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:08:34,311 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 14:08:34,311 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:08:34,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:08:34,312 INFO L82 PathProgramCache]: Analyzing trace with hash 793934666, now seen corresponding path program 3 times [2019-12-07 14:08:34,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:08:34,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006482321] [2019-12-07 14:08:34,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:08:34,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:08:34,498 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 14:08:34,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006482321] [2019-12-07 14:08:34,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:08:34,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 14:08:34,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273981520] [2019-12-07 14:08:34,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 14:08:34,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:08:34,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 14:08:34,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-07 14:08:34,499 INFO L87 Difference]: Start difference. First operand 828 states and 1812 transitions. Second operand 12 states. [2019-12-07 14:08:35,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:08:35,132 INFO L93 Difference]: Finished difference Result 1154 states and 2472 transitions. [2019-12-07 14:08:35,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 14:08:35,132 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 52 [2019-12-07 14:08:35,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:08:35,133 INFO L225 Difference]: With dead ends: 1154 [2019-12-07 14:08:35,133 INFO L226 Difference]: Without dead ends: 777 [2019-12-07 14:08:35,133 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=513, Unknown=0, NotChecked=0, Total=650 [2019-12-07 14:08:35,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2019-12-07 14:08:35,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 768. [2019-12-07 14:08:35,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 768 states. [2019-12-07 14:08:35,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 1674 transitions. [2019-12-07 14:08:35,139 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 1674 transitions. Word has length 52 [2019-12-07 14:08:35,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:08:35,139 INFO L462 AbstractCegarLoop]: Abstraction has 768 states and 1674 transitions. [2019-12-07 14:08:35,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 14:08:35,139 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1674 transitions. [2019-12-07 14:08:35,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 14:08:35,140 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:08:35,140 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:08:35,140 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:08:35,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:08:35,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1604907066, now seen corresponding path program 4 times [2019-12-07 14:08:35,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:08:35,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105127909] [2019-12-07 14:08:35,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:08:35,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:08:35,328 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 14:08:35,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105127909] [2019-12-07 14:08:35,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:08:35,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 14:08:35,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509016641] [2019-12-07 14:08:35,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 14:08:35,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:08:35,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 14:08:35,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-07 14:08:35,329 INFO L87 Difference]: Start difference. First operand 768 states and 1674 transitions. Second operand 13 states. [2019-12-07 14:08:35,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:08:35,860 INFO L93 Difference]: Finished difference Result 1014 states and 2163 transitions. [2019-12-07 14:08:35,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 14:08:35,861 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2019-12-07 14:08:35,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:08:35,861 INFO L225 Difference]: With dead ends: 1014 [2019-12-07 14:08:35,861 INFO L226 Difference]: Without dead ends: 767 [2019-12-07 14:08:35,862 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=607, Unknown=0, NotChecked=0, Total=756 [2019-12-07 14:08:35,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2019-12-07 14:08:35,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 767. [2019-12-07 14:08:35,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 767 states. [2019-12-07 14:08:35,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1672 transitions. [2019-12-07 14:08:35,868 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1672 transitions. Word has length 52 [2019-12-07 14:08:35,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:08:35,868 INFO L462 AbstractCegarLoop]: Abstraction has 767 states and 1672 transitions. [2019-12-07 14:08:35,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 14:08:35,868 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1672 transitions. [2019-12-07 14:08:35,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 14:08:35,869 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:08:35,869 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 14:08:35,869 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:08:35,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:08:35,869 INFO L82 PathProgramCache]: Analyzing trace with hash 668421800, now seen corresponding path program 5 times [2019-12-07 14:08:35,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:08:35,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980671176] [2019-12-07 14:08:35,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:08:35,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:08:36,103 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 14:08:36,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980671176] [2019-12-07 14:08:36,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:08:36,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 14:08:36,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344385301] [2019-12-07 14:08:36,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 14:08:36,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:08:36,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 14:08:36,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-07 14:08:36,105 INFO L87 Difference]: Start difference. First operand 767 states and 1672 transitions. Second operand 13 states. [2019-12-07 14:08:36,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:08:36,680 INFO L93 Difference]: Finished difference Result 1027 states and 2189 transitions. [2019-12-07 14:08:36,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 14:08:36,680 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2019-12-07 14:08:36,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:08:36,681 INFO L225 Difference]: With dead ends: 1027 [2019-12-07 14:08:36,681 INFO L226 Difference]: Without dead ends: 751 [2019-12-07 14:08:36,682 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=562, Unknown=0, NotChecked=0, Total=702 [2019-12-07 14:08:36,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2019-12-07 14:08:36,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 742. [2019-12-07 14:08:36,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 742 states. [2019-12-07 14:08:36,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1622 transitions. [2019-12-07 14:08:36,687 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1622 transitions. Word has length 52 [2019-12-07 14:08:36,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:08:36,688 INFO L462 AbstractCegarLoop]: Abstraction has 742 states and 1622 transitions. [2019-12-07 14:08:36,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 14:08:36,688 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1622 transitions. [2019-12-07 14:08:36,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 14:08:36,689 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:08:36,689 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 14:08:36,689 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:08:36,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:08:36,689 INFO L82 PathProgramCache]: Analyzing trace with hash 482770276, now seen corresponding path program 6 times [2019-12-07 14:08:36,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:08:36,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254969216] [2019-12-07 14:08:36,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:08:36,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:08:36,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:08:36,763 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:08:36,763 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 14:08:36,766 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L794: Formula: (let ((.cse0 (store |v_#valid_75| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$w_buff0~0_235) (= 0 v_~__unbuffered_cnt~0_55) (= v_~x~0_86 0) (= |v_#NULL.offset_6| 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t2313~0.base_48|) (= (select .cse0 |v_ULTIMATE.start_main_~#t2313~0.base_48|) 0) (= v_~weak$$choice2~0_112 0) (= v_~main$tmp_guard0~0_29 0) (= v_~y$r_buff0_thd1~0_177 0) (= 0 v_~y$r_buff0_thd2~0_324) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2313~0.base_48| 4)) (= v_~y$r_buff1_thd0~0_129 0) (= |v_ULTIMATE.start_main_~#t2313~0.offset_31| 0) (= v_~y$read_delayed~0_6 0) (= v_~__unbuffered_p1_EBX~0_49 0) (= 0 v_~weak$$choice0~0_29) (= v_~y$w_buff1~0_162 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~main$tmp_guard1~0_41 0) (= 0 |v_#NULL.base_6|) (= v_~y$w_buff0_used~0_632 0) (= 0 v_~__unbuffered_p1_EAX~0_55) (= v_~y~0_137 0) (= |v_#valid_73| (store .cse0 |v_ULTIMATE.start_main_~#t2313~0.base_48| 1)) (= v_~y$r_buff0_thd0~0_125 0) (= 0 v_~y$flush_delayed~0_38) (= v_~y$mem_tmp~0_31 0) (= v_~y$w_buff1_used~0_311 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~y$r_buff1_thd2~0_223) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2313~0.base_48| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2313~0.base_48|) |v_ULTIMATE.start_main_~#t2313~0.offset_31| 0))) (= v_~y$r_buff1_thd1~0_115 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2314~0.base=|v_ULTIMATE.start_main_~#t2314~0.base_49|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_632, ULTIMATE.start_main_~#t2313~0.offset=|v_ULTIMATE.start_main_~#t2313~0.offset_31|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_41, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_430|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_84|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_115, ~y$mem_tmp~0=v_~y$mem_tmp~0_31, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_55, ~y$w_buff0~0=v_~y$w_buff0~0_235, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_177, ~y$flush_delayed~0=v_~y$flush_delayed~0_38, #length=|v_#length_17|, ~y~0=v_~y~0_137, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_49, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_223, ~weak$$choice0~0=v_~weak$$choice0~0_29, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_89|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_62|, ~y$w_buff1~0=v_~y$w_buff1~0_162, ULTIMATE.start_main_~#t2313~0.base=|v_ULTIMATE.start_main_~#t2313~0.base_48|, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, #valid=|v_#valid_73|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_324, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_15|, ULTIMATE.start_main_~#t2314~0.offset=|v_ULTIMATE.start_main_~#t2314~0.offset_31|, ~weak$$choice2~0=v_~weak$$choice2~0_112, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_129, ~x~0=v_~x~0_86, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_311} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2314~0.base, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t2313~0.offset, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ULTIMATE.start_main_~#t2313~0.base, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t2314~0.offset, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 14:08:36,766 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L794-1-->L796: Formula: (and (= |v_ULTIMATE.start_main_~#t2314~0.offset_11| 0) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2314~0.base_13|)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t2314~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t2314~0.base_13| 0)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2314~0.base_13| 1)) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t2314~0.base_13| 4) |v_#length_11|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2314~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2314~0.base_13|) |v_ULTIMATE.start_main_~#t2314~0.offset_11| 1)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t2314~0.base=|v_ULTIMATE.start_main_~#t2314~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_11|, ULTIMATE.start_main_~#t2314~0.offset=|v_ULTIMATE.start_main_~#t2314~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2314~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2314~0.offset] because there is no mapped edge [2019-12-07 14:08:36,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L4-->L738: Formula: (and (= ~y$r_buff1_thd2~0_Out-697115594 ~y$r_buff0_thd2~0_In-697115594) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-697115594 0)) (= ~y$r_buff1_thd0~0_Out-697115594 ~y$r_buff0_thd0~0_In-697115594) (= ~y$r_buff1_thd1~0_Out-697115594 ~y$r_buff0_thd1~0_In-697115594) (= ~x~0_Out-697115594 1) (= ~y$r_buff0_thd1~0_Out-697115594 1)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-697115594, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-697115594, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-697115594, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-697115594} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-697115594, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-697115594, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-697115594, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-697115594, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-697115594, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-697115594, ~x~0=~x~0_Out-697115594, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-697115594} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 14:08:36,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In1781909868 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1781909868 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out1781909868| 0) (not .cse0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out1781909868| ~y$w_buff0_used~0_In1781909868) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1781909868, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1781909868} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1781909868|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1781909868, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1781909868} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 14:08:36,769 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L762-->L762-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In686826397 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite20_In686826397| |P1Thread1of1ForFork1_#t~ite20_Out686826397|) (= ~y$w_buff0_used~0_In686826397 |P1Thread1of1ForFork1_#t~ite21_Out686826397|)) (and (= |P1Thread1of1ForFork1_#t~ite20_Out686826397| |P1Thread1of1ForFork1_#t~ite21_Out686826397|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In686826397 256)))) (or (and (= (mod ~y$r_buff1_thd2~0_In686826397 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In686826397 256)) (and (= 0 (mod ~y$w_buff1_used~0_In686826397 256)) .cse1))) .cse0 (= |P1Thread1of1ForFork1_#t~ite20_Out686826397| ~y$w_buff0_used~0_In686826397)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In686826397, ~y$w_buff0_used~0=~y$w_buff0_used~0_In686826397, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In686826397|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In686826397, ~weak$$choice2~0=~weak$$choice2~0_In686826397, ~y$w_buff1_used~0=~y$w_buff1_used~0_In686826397} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In686826397, ~y$w_buff0_used~0=~y$w_buff0_used~0_In686826397, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out686826397|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In686826397, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out686826397|, ~weak$$choice2~0=~weak$$choice2~0_In686826397, ~y$w_buff1_used~0=~y$w_buff1_used~0_In686826397} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 14:08:36,770 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In-118526399 256))) (.cse5 (= 0 (mod ~weak$$choice2~0_In-118526399 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-118526399 256))) (.cse4 (= |P1Thread1of1ForFork1_#t~ite23_Out-118526399| |P1Thread1of1ForFork1_#t~ite24_Out-118526399|)) (.cse2 (= (mod ~y$w_buff0_used~0_In-118526399 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-118526399 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite22_In-118526399| |P1Thread1of1ForFork1_#t~ite22_Out-118526399|) (or (and (or (and .cse0 .cse1) .cse2 (and .cse0 .cse3)) .cse4 .cse5 (= |P1Thread1of1ForFork1_#t~ite23_Out-118526399| ~y$w_buff1_used~0_In-118526399)) (and (not .cse5) (= |P1Thread1of1ForFork1_#t~ite23_Out-118526399| |P1Thread1of1ForFork1_#t~ite23_In-118526399|) (= |P1Thread1of1ForFork1_#t~ite24_Out-118526399| ~y$w_buff1_used~0_In-118526399)))) (let ((.cse6 (not .cse0))) (and (= 0 |P1Thread1of1ForFork1_#t~ite22_Out-118526399|) (or (not .cse3) .cse6) .cse5 (or (not .cse1) .cse6) .cse4 (= |P1Thread1of1ForFork1_#t~ite23_Out-118526399| |P1Thread1of1ForFork1_#t~ite22_Out-118526399|) (not .cse2))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-118526399, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-118526399, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-118526399, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-118526399|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In-118526399|, ~weak$$choice2~0=~weak$$choice2~0_In-118526399, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-118526399} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-118526399, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-118526399, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-118526399, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-118526399|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-118526399|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out-118526399|, ~weak$$choice2~0=~weak$$choice2~0_In-118526399, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-118526399} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-07 14:08:36,770 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-95601127 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd1~0_In-95601127 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-95601127 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-95601127 256) 0))) (or (and (= ~y$w_buff1_used~0_In-95601127 |P0Thread1of1ForFork0_#t~ite6_Out-95601127|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-95601127|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-95601127, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-95601127, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-95601127, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-95601127} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-95601127|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-95601127, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-95601127, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-95601127, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-95601127} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 14:08:36,770 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-1332556049 256))) (.cse2 (= ~y$r_buff0_thd1~0_In-1332556049 ~y$r_buff0_thd1~0_Out-1332556049)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1332556049 256) 0))) (or (and (= ~y$r_buff0_thd1~0_Out-1332556049 0) (not .cse0) (not .cse1)) (and .cse1 .cse2) (and .cse2 .cse0))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1332556049, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1332556049} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1332556049, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1332556049|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1332556049} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 14:08:36,770 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In1194665576 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In1194665576 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In1194665576 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In1194665576 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1194665576|)) (and (or .cse1 .cse0) (= ~y$r_buff1_thd1~0_In1194665576 |P0Thread1of1ForFork0_#t~ite8_Out1194665576|) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1194665576, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1194665576, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1194665576, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1194665576} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1194665576, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1194665576, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1194665576|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1194665576, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1194665576} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 14:08:36,770 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L763-8-->L765: Formula: (and (= v_~y$w_buff1_used~0_299 |v_P1Thread1of1ForFork1_#t~ite24_27|) (not (= (mod v_~weak$$choice2~0_92 256) 0)) (= v_~y$r_buff0_thd2~0_309 v_~y$r_buff0_thd2~0_310)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_310, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_27|, ~weak$$choice2~0=v_~weak$$choice2~0_92} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_309, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_26|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_26|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_22|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_27|, ~weak$$choice2~0=v_~weak$$choice2~0_92, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_29|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_32|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_299} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 14:08:36,771 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L765-->L765-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In86852978 256)))) (or (and (= ~y$r_buff1_thd2~0_In86852978 |P1Thread1of1ForFork1_#t~ite29_Out86852978|) (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In86852978 256) 0))) (or (and .cse0 (= (mod ~y$r_buff1_thd2~0_In86852978 256) 0)) (and (= 0 (mod ~y$w_buff1_used~0_In86852978 256)) .cse0) (= (mod ~y$w_buff0_used~0_In86852978 256) 0))) (= |P1Thread1of1ForFork1_#t~ite30_Out86852978| |P1Thread1of1ForFork1_#t~ite29_Out86852978|) .cse1) (and (= |P1Thread1of1ForFork1_#t~ite29_In86852978| |P1Thread1of1ForFork1_#t~ite29_Out86852978|) (= |P1Thread1of1ForFork1_#t~ite30_Out86852978| ~y$r_buff1_thd2~0_In86852978) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In86852978, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In86852978|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In86852978, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In86852978, ~weak$$choice2~0=~weak$$choice2~0_In86852978, ~y$w_buff1_used~0=~y$w_buff1_used~0_In86852978} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In86852978, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out86852978|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out86852978|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In86852978, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In86852978, ~weak$$choice2~0=~weak$$choice2~0_In86852978, ~y$w_buff1_used~0=~y$w_buff1_used~0_In86852978} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 14:08:36,771 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L767-->L771: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~y~0_25 v_~y$mem_tmp~0_5) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~y~0=v_~y~0_25} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-07 14:08:36,771 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-831051704 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-831051704 256) 0))) (or (and (or .cse0 .cse1) (= ~y~0_In-831051704 |P1Thread1of1ForFork1_#t~ite32_Out-831051704|)) (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In-831051704 |P1Thread1of1ForFork1_#t~ite32_Out-831051704|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-831051704, ~y$w_buff1~0=~y$w_buff1~0_In-831051704, ~y~0=~y~0_In-831051704, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-831051704} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-831051704, ~y$w_buff1~0=~y$w_buff1~0_In-831051704, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-831051704|, ~y~0=~y~0_In-831051704, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-831051704} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 14:08:36,771 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L771-4-->L772: Formula: (= v_~y~0_18 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_11|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-07 14:08:36,771 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1460926566 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1460926566 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-1460926566|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-1460926566 |P1Thread1of1ForFork1_#t~ite34_Out-1460926566|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1460926566, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1460926566} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1460926566, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1460926566, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1460926566|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 14:08:36,772 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd2~0_In443869226 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In443869226 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In443869226 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In443869226 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite35_Out443869226| 0)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out443869226| ~y$w_buff1_used~0_In443869226) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In443869226, ~y$w_buff0_used~0=~y$w_buff0_used~0_In443869226, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In443869226, ~y$w_buff1_used~0=~y$w_buff1_used~0_In443869226} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In443869226, ~y$w_buff0_used~0=~y$w_buff0_used~0_In443869226, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In443869226, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out443869226|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In443869226} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 14:08:36,772 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-2137819605 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-2137819605 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out-2137819605| ~y$r_buff0_thd2~0_In-2137819605)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out-2137819605| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2137819605, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2137819605} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2137819605, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2137819605, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-2137819605|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 14:08:36,772 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In1643173862 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1643173862 256))) (.cse3 (= (mod ~y$r_buff0_thd2~0_In1643173862 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In1643173862 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite37_Out1643173862| ~y$r_buff1_thd2~0_In1643173862) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite37_Out1643173862| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1643173862, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1643173862, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1643173862, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1643173862} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1643173862, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1643173862, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1643173862, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1643173862|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1643173862} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 14:08:36,772 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L775-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1)) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~y$r_buff1_thd2~0_106 |v_P1Thread1of1ForFork1_#t~ite37_26|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_26|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_106, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_25|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 14:08:36,773 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_69 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 14:08:36,773 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L800-->L802-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_38 256)) (= (mod v_~y$w_buff0_used~0_265 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 14:08:36,773 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-1586983531 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-1586983531 256) 0))) (or (and (= ~y$w_buff1~0_In-1586983531 |ULTIMATE.start_main_#t~ite40_Out-1586983531|) (not .cse0) (not .cse1)) (and (= ~y~0_In-1586983531 |ULTIMATE.start_main_#t~ite40_Out-1586983531|) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1586983531, ~y~0=~y~0_In-1586983531, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1586983531, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1586983531} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1586983531|, ~y$w_buff1~0=~y$w_buff1~0_In-1586983531, ~y~0=~y~0_In-1586983531, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1586983531, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1586983531} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 14:08:36,773 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L802-4-->L803: Formula: (= v_~y~0_51 |v_ULTIMATE.start_main_#t~ite40_24|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_24|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ~y~0=v_~y~0_51} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-07 14:08:36,773 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In367976092 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In367976092 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite42_Out367976092| ~y$w_buff0_used~0_In367976092)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out367976092| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In367976092, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In367976092} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In367976092, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In367976092, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out367976092|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 14:08:36,773 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-497678427 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-497678427 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-497678427 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-497678427 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite43_Out-497678427|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~y$w_buff1_used~0_In-497678427 |ULTIMATE.start_main_#t~ite43_Out-497678427|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-497678427, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-497678427, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-497678427, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-497678427} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-497678427, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-497678427, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-497678427|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-497678427, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-497678427} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 14:08:36,774 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-915530801 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-915530801 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-915530801| ~y$r_buff0_thd0~0_In-915530801) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite44_Out-915530801| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-915530801, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-915530801} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-915530801, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-915530801, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-915530801|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 14:08:36,774 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-2079191991 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-2079191991 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-2079191991 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd0~0_In-2079191991 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite45_Out-2079191991| ~y$r_buff1_thd0~0_In-2079191991)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite45_Out-2079191991| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2079191991, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2079191991, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2079191991, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2079191991} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2079191991, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2079191991, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2079191991, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-2079191991|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2079191991} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 14:08:36,774 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L806-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= |v_ULTIMATE.start_main_#t~ite45_31| v_~y$r_buff1_thd0~0_77) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~main$tmp_guard1~0_13 (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_17 0) (= 1 v_~__unbuffered_p1_EAX~0_21))) 1 0)) 0 1))) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_77, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 14:08:36,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 02:08:36 BasicIcfg [2019-12-07 14:08:36,823 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 14:08:36,823 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 14:08:36,823 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 14:08:36,823 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 14:08:36,824 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:08:24" (3/4) ... [2019-12-07 14:08:36,826 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 14:08:36,826 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L794: Formula: (let ((.cse0 (store |v_#valid_75| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$w_buff0~0_235) (= 0 v_~__unbuffered_cnt~0_55) (= v_~x~0_86 0) (= |v_#NULL.offset_6| 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t2313~0.base_48|) (= (select .cse0 |v_ULTIMATE.start_main_~#t2313~0.base_48|) 0) (= v_~weak$$choice2~0_112 0) (= v_~main$tmp_guard0~0_29 0) (= v_~y$r_buff0_thd1~0_177 0) (= 0 v_~y$r_buff0_thd2~0_324) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2313~0.base_48| 4)) (= v_~y$r_buff1_thd0~0_129 0) (= |v_ULTIMATE.start_main_~#t2313~0.offset_31| 0) (= v_~y$read_delayed~0_6 0) (= v_~__unbuffered_p1_EBX~0_49 0) (= 0 v_~weak$$choice0~0_29) (= v_~y$w_buff1~0_162 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~main$tmp_guard1~0_41 0) (= 0 |v_#NULL.base_6|) (= v_~y$w_buff0_used~0_632 0) (= 0 v_~__unbuffered_p1_EAX~0_55) (= v_~y~0_137 0) (= |v_#valid_73| (store .cse0 |v_ULTIMATE.start_main_~#t2313~0.base_48| 1)) (= v_~y$r_buff0_thd0~0_125 0) (= 0 v_~y$flush_delayed~0_38) (= v_~y$mem_tmp~0_31 0) (= v_~y$w_buff1_used~0_311 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~y$r_buff1_thd2~0_223) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2313~0.base_48| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2313~0.base_48|) |v_ULTIMATE.start_main_~#t2313~0.offset_31| 0))) (= v_~y$r_buff1_thd1~0_115 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2314~0.base=|v_ULTIMATE.start_main_~#t2314~0.base_49|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_632, ULTIMATE.start_main_~#t2313~0.offset=|v_ULTIMATE.start_main_~#t2313~0.offset_31|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_41, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_430|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_84|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_115, ~y$mem_tmp~0=v_~y$mem_tmp~0_31, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_55, ~y$w_buff0~0=v_~y$w_buff0~0_235, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_177, ~y$flush_delayed~0=v_~y$flush_delayed~0_38, #length=|v_#length_17|, ~y~0=v_~y~0_137, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_49, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_223, ~weak$$choice0~0=v_~weak$$choice0~0_29, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_89|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_62|, ~y$w_buff1~0=v_~y$w_buff1~0_162, ULTIMATE.start_main_~#t2313~0.base=|v_ULTIMATE.start_main_~#t2313~0.base_48|, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, #valid=|v_#valid_73|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_324, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_15|, ULTIMATE.start_main_~#t2314~0.offset=|v_ULTIMATE.start_main_~#t2314~0.offset_31|, ~weak$$choice2~0=v_~weak$$choice2~0_112, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_129, ~x~0=v_~x~0_86, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_311} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2314~0.base, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t2313~0.offset, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ULTIMATE.start_main_~#t2313~0.base, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t2314~0.offset, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 14:08:36,827 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L794-1-->L796: Formula: (and (= |v_ULTIMATE.start_main_~#t2314~0.offset_11| 0) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2314~0.base_13|)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t2314~0.base_13|) (not (= |v_ULTIMATE.start_main_~#t2314~0.base_13| 0)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2314~0.base_13| 1)) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t2314~0.base_13| 4) |v_#length_11|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2314~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2314~0.base_13|) |v_ULTIMATE.start_main_~#t2314~0.offset_11| 1)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t2314~0.base=|v_ULTIMATE.start_main_~#t2314~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_11|, ULTIMATE.start_main_~#t2314~0.offset=|v_ULTIMATE.start_main_~#t2314~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2314~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2314~0.offset] because there is no mapped edge [2019-12-07 14:08:36,827 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L4-->L738: Formula: (and (= ~y$r_buff1_thd2~0_Out-697115594 ~y$r_buff0_thd2~0_In-697115594) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-697115594 0)) (= ~y$r_buff1_thd0~0_Out-697115594 ~y$r_buff0_thd0~0_In-697115594) (= ~y$r_buff1_thd1~0_Out-697115594 ~y$r_buff0_thd1~0_In-697115594) (= ~x~0_Out-697115594 1) (= ~y$r_buff0_thd1~0_Out-697115594 1)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-697115594, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-697115594, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-697115594, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-697115594} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-697115594, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-697115594, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-697115594, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-697115594, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-697115594, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-697115594, ~x~0=~x~0_Out-697115594, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-697115594} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 14:08:36,829 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In1781909868 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1781909868 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out1781909868| 0) (not .cse0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out1781909868| ~y$w_buff0_used~0_In1781909868) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1781909868, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1781909868} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1781909868|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1781909868, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1781909868} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 14:08:36,831 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L762-->L762-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In686826397 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite20_In686826397| |P1Thread1of1ForFork1_#t~ite20_Out686826397|) (= ~y$w_buff0_used~0_In686826397 |P1Thread1of1ForFork1_#t~ite21_Out686826397|)) (and (= |P1Thread1of1ForFork1_#t~ite20_Out686826397| |P1Thread1of1ForFork1_#t~ite21_Out686826397|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In686826397 256)))) (or (and (= (mod ~y$r_buff1_thd2~0_In686826397 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In686826397 256)) (and (= 0 (mod ~y$w_buff1_used~0_In686826397 256)) .cse1))) .cse0 (= |P1Thread1of1ForFork1_#t~ite20_Out686826397| ~y$w_buff0_used~0_In686826397)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In686826397, ~y$w_buff0_used~0=~y$w_buff0_used~0_In686826397, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In686826397|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In686826397, ~weak$$choice2~0=~weak$$choice2~0_In686826397, ~y$w_buff1_used~0=~y$w_buff1_used~0_In686826397} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In686826397, ~y$w_buff0_used~0=~y$w_buff0_used~0_In686826397, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out686826397|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In686826397, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out686826397|, ~weak$$choice2~0=~weak$$choice2~0_In686826397, ~y$w_buff1_used~0=~y$w_buff1_used~0_In686826397} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 14:08:36,831 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In-118526399 256))) (.cse5 (= 0 (mod ~weak$$choice2~0_In-118526399 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-118526399 256))) (.cse4 (= |P1Thread1of1ForFork1_#t~ite23_Out-118526399| |P1Thread1of1ForFork1_#t~ite24_Out-118526399|)) (.cse2 (= (mod ~y$w_buff0_used~0_In-118526399 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-118526399 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite22_In-118526399| |P1Thread1of1ForFork1_#t~ite22_Out-118526399|) (or (and (or (and .cse0 .cse1) .cse2 (and .cse0 .cse3)) .cse4 .cse5 (= |P1Thread1of1ForFork1_#t~ite23_Out-118526399| ~y$w_buff1_used~0_In-118526399)) (and (not .cse5) (= |P1Thread1of1ForFork1_#t~ite23_Out-118526399| |P1Thread1of1ForFork1_#t~ite23_In-118526399|) (= |P1Thread1of1ForFork1_#t~ite24_Out-118526399| ~y$w_buff1_used~0_In-118526399)))) (let ((.cse6 (not .cse0))) (and (= 0 |P1Thread1of1ForFork1_#t~ite22_Out-118526399|) (or (not .cse3) .cse6) .cse5 (or (not .cse1) .cse6) .cse4 (= |P1Thread1of1ForFork1_#t~ite23_Out-118526399| |P1Thread1of1ForFork1_#t~ite22_Out-118526399|) (not .cse2))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-118526399, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-118526399, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-118526399, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-118526399|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In-118526399|, ~weak$$choice2~0=~weak$$choice2~0_In-118526399, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-118526399} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-118526399, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-118526399, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-118526399, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-118526399|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-118526399|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out-118526399|, ~weak$$choice2~0=~weak$$choice2~0_In-118526399, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-118526399} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-07 14:08:36,832 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-95601127 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd1~0_In-95601127 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-95601127 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-95601127 256) 0))) (or (and (= ~y$w_buff1_used~0_In-95601127 |P0Thread1of1ForFork0_#t~ite6_Out-95601127|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-95601127|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-95601127, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-95601127, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-95601127, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-95601127} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-95601127|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-95601127, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-95601127, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-95601127, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-95601127} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 14:08:36,832 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-1332556049 256))) (.cse2 (= ~y$r_buff0_thd1~0_In-1332556049 ~y$r_buff0_thd1~0_Out-1332556049)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1332556049 256) 0))) (or (and (= ~y$r_buff0_thd1~0_Out-1332556049 0) (not .cse0) (not .cse1)) (and .cse1 .cse2) (and .cse2 .cse0))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1332556049, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1332556049} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1332556049, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1332556049|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1332556049} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 14:08:36,832 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In1194665576 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In1194665576 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In1194665576 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In1194665576 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1194665576|)) (and (or .cse1 .cse0) (= ~y$r_buff1_thd1~0_In1194665576 |P0Thread1of1ForFork0_#t~ite8_Out1194665576|) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1194665576, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1194665576, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1194665576, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1194665576} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1194665576, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1194665576, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1194665576|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1194665576, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1194665576} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 14:08:36,832 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L763-8-->L765: Formula: (and (= v_~y$w_buff1_used~0_299 |v_P1Thread1of1ForFork1_#t~ite24_27|) (not (= (mod v_~weak$$choice2~0_92 256) 0)) (= v_~y$r_buff0_thd2~0_309 v_~y$r_buff0_thd2~0_310)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_310, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_27|, ~weak$$choice2~0=v_~weak$$choice2~0_92} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_309, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_26|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_26|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_22|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_27|, ~weak$$choice2~0=v_~weak$$choice2~0_92, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_29|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_32|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_299} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 14:08:36,832 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L765-->L765-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In86852978 256)))) (or (and (= ~y$r_buff1_thd2~0_In86852978 |P1Thread1of1ForFork1_#t~ite29_Out86852978|) (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In86852978 256) 0))) (or (and .cse0 (= (mod ~y$r_buff1_thd2~0_In86852978 256) 0)) (and (= 0 (mod ~y$w_buff1_used~0_In86852978 256)) .cse0) (= (mod ~y$w_buff0_used~0_In86852978 256) 0))) (= |P1Thread1of1ForFork1_#t~ite30_Out86852978| |P1Thread1of1ForFork1_#t~ite29_Out86852978|) .cse1) (and (= |P1Thread1of1ForFork1_#t~ite29_In86852978| |P1Thread1of1ForFork1_#t~ite29_Out86852978|) (= |P1Thread1of1ForFork1_#t~ite30_Out86852978| ~y$r_buff1_thd2~0_In86852978) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In86852978, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In86852978|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In86852978, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In86852978, ~weak$$choice2~0=~weak$$choice2~0_In86852978, ~y$w_buff1_used~0=~y$w_buff1_used~0_In86852978} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In86852978, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out86852978|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out86852978|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In86852978, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In86852978, ~weak$$choice2~0=~weak$$choice2~0_In86852978, ~y$w_buff1_used~0=~y$w_buff1_used~0_In86852978} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 14:08:36,833 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L767-->L771: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~y~0_25 v_~y$mem_tmp~0_5) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~y~0=v_~y~0_25} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-07 14:08:36,833 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-831051704 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-831051704 256) 0))) (or (and (or .cse0 .cse1) (= ~y~0_In-831051704 |P1Thread1of1ForFork1_#t~ite32_Out-831051704|)) (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In-831051704 |P1Thread1of1ForFork1_#t~ite32_Out-831051704|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-831051704, ~y$w_buff1~0=~y$w_buff1~0_In-831051704, ~y~0=~y~0_In-831051704, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-831051704} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-831051704, ~y$w_buff1~0=~y$w_buff1~0_In-831051704, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-831051704|, ~y~0=~y~0_In-831051704, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-831051704} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 14:08:36,833 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L771-4-->L772: Formula: (= v_~y~0_18 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_11|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-07 14:08:36,833 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1460926566 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1460926566 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-1460926566|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-1460926566 |P1Thread1of1ForFork1_#t~ite34_Out-1460926566|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1460926566, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1460926566} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1460926566, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1460926566, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1460926566|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 14:08:36,834 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd2~0_In443869226 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In443869226 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In443869226 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In443869226 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite35_Out443869226| 0)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out443869226| ~y$w_buff1_used~0_In443869226) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In443869226, ~y$w_buff0_used~0=~y$w_buff0_used~0_In443869226, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In443869226, ~y$w_buff1_used~0=~y$w_buff1_used~0_In443869226} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In443869226, ~y$w_buff0_used~0=~y$w_buff0_used~0_In443869226, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In443869226, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out443869226|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In443869226} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 14:08:36,834 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-2137819605 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-2137819605 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite36_Out-2137819605| ~y$r_buff0_thd2~0_In-2137819605)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out-2137819605| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2137819605, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2137819605} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2137819605, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2137819605, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-2137819605|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 14:08:36,834 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In1643173862 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1643173862 256))) (.cse3 (= (mod ~y$r_buff0_thd2~0_In1643173862 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In1643173862 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite37_Out1643173862| ~y$r_buff1_thd2~0_In1643173862) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite37_Out1643173862| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1643173862, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1643173862, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1643173862, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1643173862} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1643173862, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1643173862, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1643173862, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1643173862|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1643173862} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 14:08:36,835 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L775-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1)) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~y$r_buff1_thd2~0_106 |v_P1Thread1of1ForFork1_#t~ite37_26|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_26|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_106, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_25|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 14:08:36,835 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_69 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 14:08:36,835 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L800-->L802-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_38 256)) (= (mod v_~y$w_buff0_used~0_265 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 14:08:36,835 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-1586983531 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-1586983531 256) 0))) (or (and (= ~y$w_buff1~0_In-1586983531 |ULTIMATE.start_main_#t~ite40_Out-1586983531|) (not .cse0) (not .cse1)) (and (= ~y~0_In-1586983531 |ULTIMATE.start_main_#t~ite40_Out-1586983531|) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1586983531, ~y~0=~y~0_In-1586983531, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1586983531, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1586983531} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1586983531|, ~y$w_buff1~0=~y$w_buff1~0_In-1586983531, ~y~0=~y~0_In-1586983531, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1586983531, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1586983531} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 14:08:36,835 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L802-4-->L803: Formula: (= v_~y~0_51 |v_ULTIMATE.start_main_#t~ite40_24|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_24|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ~y~0=v_~y~0_51} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-07 14:08:36,835 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In367976092 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In367976092 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite42_Out367976092| ~y$w_buff0_used~0_In367976092)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out367976092| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In367976092, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In367976092} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In367976092, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In367976092, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out367976092|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 14:08:36,835 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-497678427 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-497678427 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-497678427 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-497678427 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite43_Out-497678427|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~y$w_buff1_used~0_In-497678427 |ULTIMATE.start_main_#t~ite43_Out-497678427|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-497678427, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-497678427, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-497678427, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-497678427} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-497678427, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-497678427, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-497678427|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-497678427, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-497678427} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 14:08:36,836 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-915530801 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-915530801 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-915530801| ~y$r_buff0_thd0~0_In-915530801) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite44_Out-915530801| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-915530801, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-915530801} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-915530801, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-915530801, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-915530801|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 14:08:36,836 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-2079191991 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-2079191991 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-2079191991 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd0~0_In-2079191991 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite45_Out-2079191991| ~y$r_buff1_thd0~0_In-2079191991)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite45_Out-2079191991| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2079191991, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2079191991, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2079191991, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2079191991} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2079191991, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2079191991, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2079191991, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-2079191991|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2079191991} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 14:08:36,836 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L806-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= |v_ULTIMATE.start_main_#t~ite45_31| v_~y$r_buff1_thd0~0_77) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~main$tmp_guard1~0_13 (ite (= 0 (ite (not (and (= v_~__unbuffered_p1_EBX~0_17 0) (= 1 v_~__unbuffered_p1_EAX~0_21))) 1 0)) 0 1))) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_77, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 14:08:36,891 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_1ea26e94-3b69-409b-99ee-924d7de7aa86/bin/uautomizer/witness.graphml [2019-12-07 14:08:36,891 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 14:08:36,892 INFO L168 Benchmark]: Toolchain (without parser) took 12823.31 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 525.3 MB). Free memory was 942.5 MB in the beginning and 1.3 GB in the end (delta: -321.0 MB). Peak memory consumption was 204.3 MB. Max. memory is 11.5 GB. [2019-12-07 14:08:36,893 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:08:36,893 INFO L168 Benchmark]: CACSL2BoogieTranslator took 386.33 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 91.2 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -116.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 14:08:36,893 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.97 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 14:08:36,894 INFO L168 Benchmark]: Boogie Preprocessor took 23.97 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:08:36,894 INFO L168 Benchmark]: RCFGBuilder took 377.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 11.5 GB. [2019-12-07 14:08:36,895 INFO L168 Benchmark]: TraceAbstraction took 11928.87 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 434.1 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -277.5 MB). Peak memory consumption was 156.6 MB. Max. memory is 11.5 GB. [2019-12-07 14:08:36,895 INFO L168 Benchmark]: Witness Printer took 68.15 ms. Allocated memory is still 1.6 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2019-12-07 14:08:36,897 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 386.33 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 91.2 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -116.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.97 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.97 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 377.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11928.87 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 434.1 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -277.5 MB). Peak memory consumption was 156.6 MB. Max. memory is 11.5 GB. * Witness Printer took 68.15 ms. Allocated memory is still 1.6 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.7s, 147 ProgramPointsBefore, 75 ProgramPointsAfterwards, 181 TransitionsBefore, 84 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 28 ChoiceCompositions, 4569 VarBasedMoverChecksPositive, 175 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 211 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.7s, 0 MoverChecksTotal, 49472 CheckedPairsTotal, 106 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L794] FCALL, FORK 0 pthread_create(&t2313, ((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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L796] FCALL, FORK 0 pthread_create(&t2314, ((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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) 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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 __unbuffered_p1_EAX = x [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 y$flush_delayed = weak$$choice2 [L758] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L759] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L760] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L762] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L766] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L798] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L804] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L805] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 11.7s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1667 SDtfs, 2248 SDslu, 5282 SDs, 0 SdLazy, 5300 SolverSat, 212 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 196 GetRequests, 23 SyntacticMatches, 15 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11360occurred 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.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 4831 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 563 NumberOfCodeBlocks, 563 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 495 ConstructedInterpolants, 0 QuantifiedInterpolants, 134833 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...