./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe026_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_0c6f765a-3f85-4118-a40a-52a508a2bf96/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_0c6f765a-3f85-4118-a40a-52a508a2bf96/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0c6f765a-3f85-4118-a40a-52a508a2bf96/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0c6f765a-3f85-4118-a40a-52a508a2bf96/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe026_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_0c6f765a-3f85-4118-a40a-52a508a2bf96/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0c6f765a-3f85-4118-a40a-52a508a2bf96/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 3eee31809677f2d63a4c792c4c8ac046eb993097 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 10:46:37,398 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:46:37,400 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:46:37,408 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:46:37,409 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:46:37,409 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:46:37,411 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:46:37,412 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:46:37,414 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:46:37,415 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:46:37,416 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:46:37,417 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:46:37,417 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:46:37,418 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:46:37,419 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:46:37,420 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:46:37,421 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:46:37,422 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:46:37,423 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:46:37,425 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:46:37,426 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:46:37,427 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:46:37,428 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:46:37,429 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:46:37,431 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:46:37,431 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:46:37,431 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:46:37,432 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:46:37,432 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:46:37,433 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:46:37,433 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:46:37,433 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:46:37,434 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:46:37,434 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:46:37,435 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:46:37,435 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:46:37,436 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:46:37,436 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:46:37,436 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:46:37,437 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:46:37,437 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:46:37,438 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0c6f765a-3f85-4118-a40a-52a508a2bf96/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 10:46:37,450 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:46:37,450 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:46:37,451 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 10:46:37,451 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 10:46:37,451 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 10:46:37,451 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:46:37,452 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:46:37,452 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:46:37,452 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:46:37,452 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:46:37,452 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 10:46:37,452 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:46:37,452 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 10:46:37,453 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:46:37,453 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:46:37,453 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:46:37,453 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 10:46:37,453 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:46:37,453 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 10:46:37,454 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:46:37,454 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:46:37,454 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:46:37,454 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:46:37,454 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:46:37,454 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 10:46:37,454 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 10:46:37,454 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 10:46:37,455 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 10:46:37,455 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:46:37,455 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_0c6f765a-3f85-4118-a40a-52a508a2bf96/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 -> 3eee31809677f2d63a4c792c4c8ac046eb993097 [2019-12-07 10:46:37,562 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:46:37,570 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:46:37,572 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:46:37,573 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:46:37,574 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:46:37,574 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0c6f765a-3f85-4118-a40a-52a508a2bf96/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe026_power.opt.i [2019-12-07 10:46:37,610 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0c6f765a-3f85-4118-a40a-52a508a2bf96/bin/uautomizer/data/a9bb7c6b7/bc7cb00e4e9d4ae89618c82401452de9/FLAG9b23a568d [2019-12-07 10:46:38,081 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:46:38,081 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0c6f765a-3f85-4118-a40a-52a508a2bf96/sv-benchmarks/c/pthread-wmm/safe026_power.opt.i [2019-12-07 10:46:38,091 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0c6f765a-3f85-4118-a40a-52a508a2bf96/bin/uautomizer/data/a9bb7c6b7/bc7cb00e4e9d4ae89618c82401452de9/FLAG9b23a568d [2019-12-07 10:46:38,101 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0c6f765a-3f85-4118-a40a-52a508a2bf96/bin/uautomizer/data/a9bb7c6b7/bc7cb00e4e9d4ae89618c82401452de9 [2019-12-07 10:46:38,102 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:46:38,103 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:46:38,104 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:46:38,104 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:46:38,106 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:46:38,107 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:46:38" (1/1) ... [2019-12-07 10:46:38,109 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a2ff042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:46:38, skipping insertion in model container [2019-12-07 10:46:38,109 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:46:38" (1/1) ... [2019-12-07 10:46:38,114 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:46:38,144 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:46:38,390 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:46:38,397 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:46:38,439 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:46:38,483 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:46:38,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:46:38 WrapperNode [2019-12-07 10:46:38,483 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:46:38,483 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:46:38,484 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:46:38,484 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:46:38,489 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:46:38" (1/1) ... [2019-12-07 10:46:38,502 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:46:38" (1/1) ... [2019-12-07 10:46:38,519 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:46:38,519 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:46:38,519 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:46:38,520 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:46:38,526 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:46:38" (1/1) ... [2019-12-07 10:46:38,526 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:46:38" (1/1) ... [2019-12-07 10:46:38,529 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:46:38" (1/1) ... [2019-12-07 10:46:38,529 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:46:38" (1/1) ... [2019-12-07 10:46:38,536 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:46:38" (1/1) ... [2019-12-07 10:46:38,539 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:46:38" (1/1) ... [2019-12-07 10:46:38,541 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:46:38" (1/1) ... [2019-12-07 10:46:38,544 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:46:38,544 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:46:38,544 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:46:38,545 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:46:38,545 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:46:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0c6f765a-3f85-4118-a40a-52a508a2bf96/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 10:46:38,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 10:46:38,590 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 10:46:38,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 10:46:38,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 10:46:38,591 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 10:46:38,591 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 10:46:38,591 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 10:46:38,591 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 10:46:38,591 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 10:46:38,591 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 10:46:38,591 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 10:46:38,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:46:38,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:46:38,593 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 10:46:38,957 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:46:38,957 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 10:46:38,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:46:38 BoogieIcfgContainer [2019-12-07 10:46:38,958 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:46:38,959 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:46:38,959 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:46:38,961 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:46:38,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:46:38" (1/3) ... [2019-12-07 10:46:38,962 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b7d563 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:46:38, skipping insertion in model container [2019-12-07 10:46:38,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:46:38" (2/3) ... [2019-12-07 10:46:38,962 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b7d563 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:46:38, skipping insertion in model container [2019-12-07 10:46:38,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:46:38" (3/3) ... [2019-12-07 10:46:38,963 INFO L109 eAbstractionObserver]: Analyzing ICFG safe026_power.opt.i [2019-12-07 10:46:38,969 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 10:46:38,970 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:46:38,974 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 10:46:38,975 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 10:46:39,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,000 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,001 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,001 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,001 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,001 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,005 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,005 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,009 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,009 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,009 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,010 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,011 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,012 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,021 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:46:39,035 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 10:46:39,052 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:46:39,052 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 10:46:39,053 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:46:39,053 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:46:39,053 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:46:39,053 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:46:39,053 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:46:39,053 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:46:39,068 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-07 10:46:39,069 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-07 10:46:39,124 INFO L134 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-07 10:46:39,124 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:46:39,135 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 701 event pairs. 9/168 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 10:46:39,149 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-07 10:46:39,182 INFO L134 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-07 10:46:39,182 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:46:39,188 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 701 event pairs. 9/168 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 10:46:39,203 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-07 10:46:39,204 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 10:46:42,260 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-07 10:46:42,368 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-07 10:46:42,387 INFO L206 etLargeBlockEncoding]: Checked pairs total: 78269 [2019-12-07 10:46:42,388 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-07 10:46:42,390 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 103 transitions [2019-12-07 10:46:55,184 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 109594 states. [2019-12-07 10:46:55,186 INFO L276 IsEmpty]: Start isEmpty. Operand 109594 states. [2019-12-07 10:46:55,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 10:46:55,190 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:46:55,191 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 10:46:55,191 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:46:55,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:46:55,196 INFO L82 PathProgramCache]: Analyzing trace with hash 909914, now seen corresponding path program 1 times [2019-12-07 10:46:55,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:46:55,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880954851] [2019-12-07 10:46:55,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:46:55,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:46:55,342 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 10:46:55,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880954851] [2019-12-07 10:46:55,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:46:55,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 10:46:55,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453513842] [2019-12-07 10:46:55,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:46:55,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:46:55,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:46:55,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:46:55,360 INFO L87 Difference]: Start difference. First operand 109594 states. Second operand 3 states. [2019-12-07 10:46:56,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:46:56,029 INFO L93 Difference]: Finished difference Result 108680 states and 463562 transitions. [2019-12-07 10:46:56,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:46:56,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 10:46:56,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:46:56,638 INFO L225 Difference]: With dead ends: 108680 [2019-12-07 10:46:56,638 INFO L226 Difference]: Without dead ends: 102440 [2019-12-07 10:46:56,639 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 10:47:00,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102440 states. [2019-12-07 10:47:01,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102440 to 102440. [2019-12-07 10:47:01,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102440 states. [2019-12-07 10:47:01,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102440 states to 102440 states and 436366 transitions. [2019-12-07 10:47:01,924 INFO L78 Accepts]: Start accepts. Automaton has 102440 states and 436366 transitions. Word has length 3 [2019-12-07 10:47:01,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:01,925 INFO L462 AbstractCegarLoop]: Abstraction has 102440 states and 436366 transitions. [2019-12-07 10:47:01,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:47:01,925 INFO L276 IsEmpty]: Start isEmpty. Operand 102440 states and 436366 transitions. [2019-12-07 10:47:01,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 10:47:01,929 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:01,929 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:47:01,929 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:47:01,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:01,929 INFO L82 PathProgramCache]: Analyzing trace with hash -975068220, now seen corresponding path program 1 times [2019-12-07 10:47:01,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:47:01,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68813001] [2019-12-07 10:47:01,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:47:01,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:02,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:47:02,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68813001] [2019-12-07 10:47:02,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:47:02,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:47:02,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457895454] [2019-12-07 10:47:02,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:47:02,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:47:02,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:47:02,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:47:02,004 INFO L87 Difference]: Start difference. First operand 102440 states and 436366 transitions. Second operand 4 states. [2019-12-07 10:47:02,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:02,948 INFO L93 Difference]: Finished difference Result 163248 states and 665679 transitions. [2019-12-07 10:47:02,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:47:02,949 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 10:47:02,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:05,428 INFO L225 Difference]: With dead ends: 163248 [2019-12-07 10:47:05,428 INFO L226 Difference]: Without dead ends: 163199 [2019-12-07 10:47:05,429 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 10:47:10,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163199 states. [2019-12-07 10:47:12,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163199 to 148639. [2019-12-07 10:47:12,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148639 states. [2019-12-07 10:47:12,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148639 states to 148639 states and 614105 transitions. [2019-12-07 10:47:12,559 INFO L78 Accepts]: Start accepts. Automaton has 148639 states and 614105 transitions. Word has length 11 [2019-12-07 10:47:12,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:12,559 INFO L462 AbstractCegarLoop]: Abstraction has 148639 states and 614105 transitions. [2019-12-07 10:47:12,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:47:12,560 INFO L276 IsEmpty]: Start isEmpty. Operand 148639 states and 614105 transitions. [2019-12-07 10:47:12,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 10:47:12,565 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:12,565 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:47:12,565 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:47:12,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:12,565 INFO L82 PathProgramCache]: Analyzing trace with hash -112330344, now seen corresponding path program 1 times [2019-12-07 10:47:12,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:47:12,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853103122] [2019-12-07 10:47:12,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:47:12,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:12,618 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 10:47:12,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853103122] [2019-12-07 10:47:12,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:47:12,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:47:12,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130906544] [2019-12-07 10:47:12,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:47:12,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:47:12,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:47:12,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:47:12,620 INFO L87 Difference]: Start difference. First operand 148639 states and 614105 transitions. Second operand 4 states. [2019-12-07 10:47:12,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:12,780 INFO L93 Difference]: Finished difference Result 43706 states and 149507 transitions. [2019-12-07 10:47:12,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:47:12,781 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 10:47:12,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:12,840 INFO L225 Difference]: With dead ends: 43706 [2019-12-07 10:47:12,840 INFO L226 Difference]: Without dead ends: 33577 [2019-12-07 10:47:12,841 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 10:47:13,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33577 states. [2019-12-07 10:47:13,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33577 to 33481. [2019-12-07 10:47:13,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33481 states. [2019-12-07 10:47:13,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33481 states to 33481 states and 108822 transitions. [2019-12-07 10:47:13,428 INFO L78 Accepts]: Start accepts. Automaton has 33481 states and 108822 transitions. Word has length 13 [2019-12-07 10:47:13,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:13,429 INFO L462 AbstractCegarLoop]: Abstraction has 33481 states and 108822 transitions. [2019-12-07 10:47:13,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:47:13,429 INFO L276 IsEmpty]: Start isEmpty. Operand 33481 states and 108822 transitions. [2019-12-07 10:47:13,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 10:47:13,431 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:13,431 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:47:13,431 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:47:13,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:13,431 INFO L82 PathProgramCache]: Analyzing trace with hash -790185689, now seen corresponding path program 1 times [2019-12-07 10:47:13,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:47:13,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365709393] [2019-12-07 10:47:13,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:47:13,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:13,493 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 10:47:13,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365709393] [2019-12-07 10:47:13,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:47:13,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:47:13,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267921905] [2019-12-07 10:47:13,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:47:13,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:47:13,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:47:13,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:47:13,494 INFO L87 Difference]: Start difference. First operand 33481 states and 108822 transitions. Second operand 5 states. [2019-12-07 10:47:13,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:13,798 INFO L93 Difference]: Finished difference Result 45175 states and 144711 transitions. [2019-12-07 10:47:13,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:47:13,799 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-07 10:47:13,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:13,861 INFO L225 Difference]: With dead ends: 45175 [2019-12-07 10:47:13,861 INFO L226 Difference]: Without dead ends: 45175 [2019-12-07 10:47:13,861 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 10:47:14,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45175 states. [2019-12-07 10:47:14,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45175 to 38347. [2019-12-07 10:47:14,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38347 states. [2019-12-07 10:47:14,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38347 states to 38347 states and 123865 transitions. [2019-12-07 10:47:14,899 INFO L78 Accepts]: Start accepts. Automaton has 38347 states and 123865 transitions. Word has length 16 [2019-12-07 10:47:14,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:14,900 INFO L462 AbstractCegarLoop]: Abstraction has 38347 states and 123865 transitions. [2019-12-07 10:47:14,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:47:14,900 INFO L276 IsEmpty]: Start isEmpty. Operand 38347 states and 123865 transitions. [2019-12-07 10:47:14,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:47:14,907 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:14,907 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:47:14,907 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:47:14,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:14,907 INFO L82 PathProgramCache]: Analyzing trace with hash 2079194331, now seen corresponding path program 1 times [2019-12-07 10:47:14,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:47:14,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062128574] [2019-12-07 10:47:14,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:47:14,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:14,974 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 10:47:14,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062128574] [2019-12-07 10:47:14,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:47:14,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:47:14,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964218757] [2019-12-07 10:47:14,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:47:14,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:47:14,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:47:14,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:47:14,975 INFO L87 Difference]: Start difference. First operand 38347 states and 123865 transitions. Second operand 6 states. [2019-12-07 10:47:15,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:15,625 INFO L93 Difference]: Finished difference Result 58112 states and 182585 transitions. [2019-12-07 10:47:15,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 10:47:15,626 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 10:47:15,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:15,711 INFO L225 Difference]: With dead ends: 58112 [2019-12-07 10:47:15,711 INFO L226 Difference]: Without dead ends: 58056 [2019-12-07 10:47:15,712 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 10:47:15,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58056 states. [2019-12-07 10:47:16,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58056 to 38947. [2019-12-07 10:47:16,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38947 states. [2019-12-07 10:47:16,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38947 states to 38947 states and 124912 transitions. [2019-12-07 10:47:16,483 INFO L78 Accepts]: Start accepts. Automaton has 38947 states and 124912 transitions. Word has length 22 [2019-12-07 10:47:16,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:16,483 INFO L462 AbstractCegarLoop]: Abstraction has 38947 states and 124912 transitions. [2019-12-07 10:47:16,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:47:16,484 INFO L276 IsEmpty]: Start isEmpty. Operand 38947 states and 124912 transitions. [2019-12-07 10:47:16,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 10:47:16,495 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:16,495 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:47:16,496 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:47:16,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:16,496 INFO L82 PathProgramCache]: Analyzing trace with hash -356343789, now seen corresponding path program 1 times [2019-12-07 10:47:16,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:47:16,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257369543] [2019-12-07 10:47:16,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:47:16,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:16,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:47:16,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257369543] [2019-12-07 10:47:16,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:47:16,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:47:16,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561012143] [2019-12-07 10:47:16,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:47:16,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:47:16,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:47:16,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:47:16,563 INFO L87 Difference]: Start difference. First operand 38947 states and 124912 transitions. Second operand 5 states. [2019-12-07 10:47:16,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:16,654 INFO L93 Difference]: Finished difference Result 17807 states and 53973 transitions. [2019-12-07 10:47:16,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:47:16,655 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 10:47:16,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:16,672 INFO L225 Difference]: With dead ends: 17807 [2019-12-07 10:47:16,672 INFO L226 Difference]: Without dead ends: 15537 [2019-12-07 10:47:16,672 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 10:47:16,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15537 states. [2019-12-07 10:47:16,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15537 to 15208. [2019-12-07 10:47:16,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15208 states. [2019-12-07 10:47:16,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15208 states to 15208 states and 46078 transitions. [2019-12-07 10:47:16,889 INFO L78 Accepts]: Start accepts. Automaton has 15208 states and 46078 transitions. Word has length 25 [2019-12-07 10:47:16,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:16,890 INFO L462 AbstractCegarLoop]: Abstraction has 15208 states and 46078 transitions. [2019-12-07 10:47:16,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:47:16,890 INFO L276 IsEmpty]: Start isEmpty. Operand 15208 states and 46078 transitions. [2019-12-07 10:47:16,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 10:47:16,899 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:16,899 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:47:16,900 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:47:16,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:16,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1041381309, now seen corresponding path program 1 times [2019-12-07 10:47:16,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:47:16,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373427206] [2019-12-07 10:47:16,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:47:16,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:17,003 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 10:47:17,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373427206] [2019-12-07 10:47:17,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:47:17,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 10:47:17,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019467210] [2019-12-07 10:47:17,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 10:47:17,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:47:17,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 10:47:17,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:47:17,005 INFO L87 Difference]: Start difference. First operand 15208 states and 46078 transitions. Second operand 8 states. [2019-12-07 10:47:17,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:17,388 INFO L93 Difference]: Finished difference Result 20223 states and 59927 transitions. [2019-12-07 10:47:17,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 10:47:17,388 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-12-07 10:47:17,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:17,408 INFO L225 Difference]: With dead ends: 20223 [2019-12-07 10:47:17,408 INFO L226 Difference]: Without dead ends: 19969 [2019-12-07 10:47:17,408 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-12-07 10:47:17,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19969 states. [2019-12-07 10:47:17,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19969 to 17340. [2019-12-07 10:47:17,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17340 states. [2019-12-07 10:47:17,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17340 states to 17340 states and 51993 transitions. [2019-12-07 10:47:17,662 INFO L78 Accepts]: Start accepts. Automaton has 17340 states and 51993 transitions. Word has length 27 [2019-12-07 10:47:17,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:17,662 INFO L462 AbstractCegarLoop]: Abstraction has 17340 states and 51993 transitions. [2019-12-07 10:47:17,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 10:47:17,663 INFO L276 IsEmpty]: Start isEmpty. Operand 17340 states and 51993 transitions. [2019-12-07 10:47:17,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 10:47:17,677 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:17,677 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] [2019-12-07 10:47:17,678 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:47:17,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:17,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1993081713, now seen corresponding path program 1 times [2019-12-07 10:47:17,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:47:17,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991176422] [2019-12-07 10:47:17,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:47:17,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:17,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:47:17,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991176422] [2019-12-07 10:47:17,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:47:17,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:47:17,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659931317] [2019-12-07 10:47:17,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 10:47:17,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:47:17,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 10:47:17,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:47:17,771 INFO L87 Difference]: Start difference. First operand 17340 states and 51993 transitions. Second operand 7 states. [2019-12-07 10:47:18,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:18,469 INFO L93 Difference]: Finished difference Result 24233 states and 70715 transitions. [2019-12-07 10:47:18,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 10:47:18,469 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-07 10:47:18,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:18,647 INFO L225 Difference]: With dead ends: 24233 [2019-12-07 10:47:18,647 INFO L226 Difference]: Without dead ends: 23546 [2019-12-07 10:47:18,647 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-07 10:47:18,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23546 states. [2019-12-07 10:47:18,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23546 to 16133. [2019-12-07 10:47:18,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16133 states. [2019-12-07 10:47:18,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16133 states to 16133 states and 48316 transitions. [2019-12-07 10:47:18,891 INFO L78 Accepts]: Start accepts. Automaton has 16133 states and 48316 transitions. Word has length 33 [2019-12-07 10:47:18,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:18,892 INFO L462 AbstractCegarLoop]: Abstraction has 16133 states and 48316 transitions. [2019-12-07 10:47:18,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 10:47:18,892 INFO L276 IsEmpty]: Start isEmpty. Operand 16133 states and 48316 transitions. [2019-12-07 10:47:18,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 10:47:18,910 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:18,910 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] [2019-12-07 10:47:18,910 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:47:18,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:18,910 INFO L82 PathProgramCache]: Analyzing trace with hash 2090975987, now seen corresponding path program 1 times [2019-12-07 10:47:18,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:47:18,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584657155] [2019-12-07 10:47:18,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:47:18,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:18,958 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 10:47:18,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584657155] [2019-12-07 10:47:18,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:47:18,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:47:18,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217153184] [2019-12-07 10:47:18,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:47:18,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:47:18,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:47:18,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:47:18,960 INFO L87 Difference]: Start difference. First operand 16133 states and 48316 transitions. Second operand 3 states. [2019-12-07 10:47:19,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:19,014 INFO L93 Difference]: Finished difference Result 16133 states and 47775 transitions. [2019-12-07 10:47:19,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:47:19,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-07 10:47:19,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:19,031 INFO L225 Difference]: With dead ends: 16133 [2019-12-07 10:47:19,031 INFO L226 Difference]: Without dead ends: 16133 [2019-12-07 10:47:19,031 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 10:47:19,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16133 states. [2019-12-07 10:47:19,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16133 to 16125. [2019-12-07 10:47:19,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16125 states. [2019-12-07 10:47:19,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16125 states to 16125 states and 47759 transitions. [2019-12-07 10:47:19,244 INFO L78 Accepts]: Start accepts. Automaton has 16125 states and 47759 transitions. Word has length 39 [2019-12-07 10:47:19,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:19,245 INFO L462 AbstractCegarLoop]: Abstraction has 16125 states and 47759 transitions. [2019-12-07 10:47:19,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:47:19,245 INFO L276 IsEmpty]: Start isEmpty. Operand 16125 states and 47759 transitions. [2019-12-07 10:47:19,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 10:47:19,263 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:19,263 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:47:19,263 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:47:19,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:19,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1263660176, now seen corresponding path program 1 times [2019-12-07 10:47:19,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:47:19,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064965181] [2019-12-07 10:47:19,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:47:19,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:19,317 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 10:47:19,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064965181] [2019-12-07 10:47:19,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:47:19,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:47:19,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925140568] [2019-12-07 10:47:19,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:47:19,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:47:19,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:47:19,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:47:19,318 INFO L87 Difference]: Start difference. First operand 16125 states and 47759 transitions. Second operand 3 states. [2019-12-07 10:47:19,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:19,365 INFO L93 Difference]: Finished difference Result 16050 states and 47529 transitions. [2019-12-07 10:47:19,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:47:19,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-07 10:47:19,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:19,383 INFO L225 Difference]: With dead ends: 16050 [2019-12-07 10:47:19,383 INFO L226 Difference]: Without dead ends: 16050 [2019-12-07 10:47:19,384 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 10:47:19,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16050 states. [2019-12-07 10:47:19,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16050 to 14119. [2019-12-07 10:47:19,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14119 states. [2019-12-07 10:47:19,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14119 states to 14119 states and 42229 transitions. [2019-12-07 10:47:19,593 INFO L78 Accepts]: Start accepts. Automaton has 14119 states and 42229 transitions. Word has length 40 [2019-12-07 10:47:19,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:19,593 INFO L462 AbstractCegarLoop]: Abstraction has 14119 states and 42229 transitions. [2019-12-07 10:47:19,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:47:19,594 INFO L276 IsEmpty]: Start isEmpty. Operand 14119 states and 42229 transitions. [2019-12-07 10:47:19,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 10:47:19,608 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:19,608 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:47:19,608 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:47:19,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:19,609 INFO L82 PathProgramCache]: Analyzing trace with hash 854921497, now seen corresponding path program 1 times [2019-12-07 10:47:19,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:47:19,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261982358] [2019-12-07 10:47:19,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:47:19,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:19,663 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 10:47:19,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261982358] [2019-12-07 10:47:19,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:47:19,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:47:19,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424303297] [2019-12-07 10:47:19,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:47:19,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:47:19,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:47:19,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:47:19,664 INFO L87 Difference]: Start difference. First operand 14119 states and 42229 transitions. Second operand 6 states. [2019-12-07 10:47:19,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:19,735 INFO L93 Difference]: Finished difference Result 13138 states and 40057 transitions. [2019-12-07 10:47:19,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:47:19,735 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-07 10:47:19,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:19,748 INFO L225 Difference]: With dead ends: 13138 [2019-12-07 10:47:19,749 INFO L226 Difference]: Without dead ends: 13025 [2019-12-07 10:47:19,749 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:47:19,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13025 states. [2019-12-07 10:47:19,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13025 to 13025. [2019-12-07 10:47:19,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13025 states. [2019-12-07 10:47:19,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13025 states to 13025 states and 39816 transitions. [2019-12-07 10:47:19,926 INFO L78 Accepts]: Start accepts. Automaton has 13025 states and 39816 transitions. Word has length 41 [2019-12-07 10:47:19,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:19,926 INFO L462 AbstractCegarLoop]: Abstraction has 13025 states and 39816 transitions. [2019-12-07 10:47:19,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:47:19,926 INFO L276 IsEmpty]: Start isEmpty. Operand 13025 states and 39816 transitions. [2019-12-07 10:47:19,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 10:47:19,938 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:19,938 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:47:19,938 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:47:19,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:19,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1128251409, now seen corresponding path program 1 times [2019-12-07 10:47:19,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:47:19,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365925639] [2019-12-07 10:47:19,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:47:19,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:19,964 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 10:47:19,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365925639] [2019-12-07 10:47:19,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:47:19,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:47:19,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795057572] [2019-12-07 10:47:19,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:47:19,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:47:19,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:47:19,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:47:19,965 INFO L87 Difference]: Start difference. First operand 13025 states and 39816 transitions. Second operand 3 states. [2019-12-07 10:47:20,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:20,029 INFO L93 Difference]: Finished difference Result 18867 states and 57936 transitions. [2019-12-07 10:47:20,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:47:20,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 10:47:20,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:20,048 INFO L225 Difference]: With dead ends: 18867 [2019-12-07 10:47:20,048 INFO L226 Difference]: Without dead ends: 18867 [2019-12-07 10:47:20,049 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:47:20,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18867 states. [2019-12-07 10:47:20,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18867 to 14565. [2019-12-07 10:47:20,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14565 states. [2019-12-07 10:47:20,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14565 states to 14565 states and 45200 transitions. [2019-12-07 10:47:20,284 INFO L78 Accepts]: Start accepts. Automaton has 14565 states and 45200 transitions. Word has length 66 [2019-12-07 10:47:20,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:20,285 INFO L462 AbstractCegarLoop]: Abstraction has 14565 states and 45200 transitions. [2019-12-07 10:47:20,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:47:20,285 INFO L276 IsEmpty]: Start isEmpty. Operand 14565 states and 45200 transitions. [2019-12-07 10:47:20,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 10:47:20,298 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:20,298 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:47:20,298 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:47:20,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:20,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1486247926, now seen corresponding path program 1 times [2019-12-07 10:47:20,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:47:20,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876905174] [2019-12-07 10:47:20,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:47:20,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:20,324 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 10:47:20,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876905174] [2019-12-07 10:47:20,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:47:20,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:47:20,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359067700] [2019-12-07 10:47:20,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:47:20,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:47:20,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:47:20,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:47:20,325 INFO L87 Difference]: Start difference. First operand 14565 states and 45200 transitions. Second operand 3 states. [2019-12-07 10:47:20,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:20,402 INFO L93 Difference]: Finished difference Result 18027 states and 54178 transitions. [2019-12-07 10:47:20,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:47:20,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 10:47:20,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:20,420 INFO L225 Difference]: With dead ends: 18027 [2019-12-07 10:47:20,420 INFO L226 Difference]: Without dead ends: 18027 [2019-12-07 10:47:20,420 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:47:20,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18027 states. [2019-12-07 10:47:20,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18027 to 13809. [2019-12-07 10:47:20,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13809 states. [2019-12-07 10:47:20,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13809 states to 13809 states and 41675 transitions. [2019-12-07 10:47:20,644 INFO L78 Accepts]: Start accepts. Automaton has 13809 states and 41675 transitions. Word has length 66 [2019-12-07 10:47:20,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:20,644 INFO L462 AbstractCegarLoop]: Abstraction has 13809 states and 41675 transitions. [2019-12-07 10:47:20,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:47:20,644 INFO L276 IsEmpty]: Start isEmpty. Operand 13809 states and 41675 transitions. [2019-12-07 10:47:20,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 10:47:20,657 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:20,658 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:47:20,658 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:47:20,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:20,658 INFO L82 PathProgramCache]: Analyzing trace with hash 2105019115, now seen corresponding path program 1 times [2019-12-07 10:47:20,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:47:20,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123468325] [2019-12-07 10:47:20,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:47:20,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:20,716 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 10:47:20,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123468325] [2019-12-07 10:47:20,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:47:20,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:47:20,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950139735] [2019-12-07 10:47:20,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:47:20,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:47:20,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:47:20,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:47:20,717 INFO L87 Difference]: Start difference. First operand 13809 states and 41675 transitions. Second operand 4 states. [2019-12-07 10:47:20,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:20,796 INFO L93 Difference]: Finished difference Result 16490 states and 49848 transitions. [2019-12-07 10:47:20,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:47:20,797 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-07 10:47:20,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:20,813 INFO L225 Difference]: With dead ends: 16490 [2019-12-07 10:47:20,813 INFO L226 Difference]: Without dead ends: 16490 [2019-12-07 10:47:20,813 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:47:20,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16490 states. [2019-12-07 10:47:20,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16490 to 12952. [2019-12-07 10:47:20,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12952 states. [2019-12-07 10:47:21,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12952 states to 12952 states and 39462 transitions. [2019-12-07 10:47:21,016 INFO L78 Accepts]: Start accepts. Automaton has 12952 states and 39462 transitions. Word has length 66 [2019-12-07 10:47:21,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:21,016 INFO L462 AbstractCegarLoop]: Abstraction has 12952 states and 39462 transitions. [2019-12-07 10:47:21,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:47:21,016 INFO L276 IsEmpty]: Start isEmpty. Operand 12952 states and 39462 transitions. [2019-12-07 10:47:21,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 10:47:21,029 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:21,029 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:47:21,029 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:47:21,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:21,029 INFO L82 PathProgramCache]: Analyzing trace with hash -991043735, now seen corresponding path program 1 times [2019-12-07 10:47:21,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:47:21,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339402052] [2019-12-07 10:47:21,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:47:21,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:21,097 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 10:47:21,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339402052] [2019-12-07 10:47:21,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:47:21,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 10:47:21,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885053014] [2019-12-07 10:47:21,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 10:47:21,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:47:21,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 10:47:21,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:47:21,099 INFO L87 Difference]: Start difference. First operand 12952 states and 39462 transitions. Second operand 7 states. [2019-12-07 10:47:21,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:21,387 INFO L93 Difference]: Finished difference Result 41069 states and 123356 transitions. [2019-12-07 10:47:21,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 10:47:21,388 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-07 10:47:21,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:21,419 INFO L225 Difference]: With dead ends: 41069 [2019-12-07 10:47:21,419 INFO L226 Difference]: Without dead ends: 30087 [2019-12-07 10:47:21,420 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-07 10:47:21,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30087 states. [2019-12-07 10:47:21,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30087 to 16030. [2019-12-07 10:47:21,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16030 states. [2019-12-07 10:47:21,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16030 states to 16030 states and 48584 transitions. [2019-12-07 10:47:21,739 INFO L78 Accepts]: Start accepts. Automaton has 16030 states and 48584 transitions. Word has length 67 [2019-12-07 10:47:21,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:21,739 INFO L462 AbstractCegarLoop]: Abstraction has 16030 states and 48584 transitions. [2019-12-07 10:47:21,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 10:47:21,739 INFO L276 IsEmpty]: Start isEmpty. Operand 16030 states and 48584 transitions. [2019-12-07 10:47:21,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 10:47:21,753 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:21,753 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:47:21,753 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:47:21,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:21,753 INFO L82 PathProgramCache]: Analyzing trace with hash -881684233, now seen corresponding path program 2 times [2019-12-07 10:47:21,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:47:21,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130973794] [2019-12-07 10:47:21,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:47:21,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:21,961 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 10:47:21,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130973794] [2019-12-07 10:47:21,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:47:21,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 10:47:21,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659782052] [2019-12-07 10:47:21,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 10:47:21,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:47:21,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 10:47:21,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-07 10:47:21,962 INFO L87 Difference]: Start difference. First operand 16030 states and 48584 transitions. Second operand 14 states. [2019-12-07 10:47:25,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:25,418 INFO L93 Difference]: Finished difference Result 35559 states and 106750 transitions. [2019-12-07 10:47:25,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-12-07 10:47:25,419 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2019-12-07 10:47:25,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:25,455 INFO L225 Difference]: With dead ends: 35559 [2019-12-07 10:47:25,456 INFO L226 Difference]: Without dead ends: 23545 [2019-12-07 10:47:25,457 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1177 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=680, Invalid=3480, Unknown=0, NotChecked=0, Total=4160 [2019-12-07 10:47:25,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23545 states. [2019-12-07 10:47:25,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23545 to 16484. [2019-12-07 10:47:25,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16484 states. [2019-12-07 10:47:25,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16484 states to 16484 states and 49582 transitions. [2019-12-07 10:47:25,731 INFO L78 Accepts]: Start accepts. Automaton has 16484 states and 49582 transitions. Word has length 67 [2019-12-07 10:47:25,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:25,731 INFO L462 AbstractCegarLoop]: Abstraction has 16484 states and 49582 transitions. [2019-12-07 10:47:25,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 10:47:25,731 INFO L276 IsEmpty]: Start isEmpty. Operand 16484 states and 49582 transitions. [2019-12-07 10:47:25,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 10:47:25,745 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:25,746 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:47:25,746 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:47:25,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:25,746 INFO L82 PathProgramCache]: Analyzing trace with hash -21722555, now seen corresponding path program 1 times [2019-12-07 10:47:25,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:47:25,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456934844] [2019-12-07 10:47:25,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:47:25,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:25,842 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 10:47:25,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456934844] [2019-12-07 10:47:25,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:47:25,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 10:47:25,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677046448] [2019-12-07 10:47:25,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 10:47:25,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:47:25,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 10:47:25,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:47:25,843 INFO L87 Difference]: Start difference. First operand 16484 states and 49582 transitions. Second operand 8 states. [2019-12-07 10:47:26,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:26,484 INFO L93 Difference]: Finished difference Result 33035 states and 99141 transitions. [2019-12-07 10:47:26,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 10:47:26,485 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 67 [2019-12-07 10:47:26,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:26,521 INFO L225 Difference]: With dead ends: 33035 [2019-12-07 10:47:26,521 INFO L226 Difference]: Without dead ends: 33035 [2019-12-07 10:47:26,522 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-12-07 10:47:26,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33035 states. [2019-12-07 10:47:26,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33035 to 21507. [2019-12-07 10:47:26,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21507 states. [2019-12-07 10:47:26,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21507 states to 21507 states and 65444 transitions. [2019-12-07 10:47:26,903 INFO L78 Accepts]: Start accepts. Automaton has 21507 states and 65444 transitions. Word has length 67 [2019-12-07 10:47:26,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:26,903 INFO L462 AbstractCegarLoop]: Abstraction has 21507 states and 65444 transitions. [2019-12-07 10:47:26,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 10:47:26,903 INFO L276 IsEmpty]: Start isEmpty. Operand 21507 states and 65444 transitions. [2019-12-07 10:47:26,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 10:47:26,922 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:26,923 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:47:26,923 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:47:26,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:26,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1599598409, now seen corresponding path program 2 times [2019-12-07 10:47:26,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:47:26,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722788517] [2019-12-07 10:47:26,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:47:26,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:27,020 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 10:47:27,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722788517] [2019-12-07 10:47:27,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:47:27,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 10:47:27,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397282883] [2019-12-07 10:47:27,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 10:47:27,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:47:27,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 10:47:27,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-07 10:47:27,021 INFO L87 Difference]: Start difference. First operand 21507 states and 65444 transitions. Second operand 10 states. [2019-12-07 10:47:27,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:27,911 INFO L93 Difference]: Finished difference Result 42398 states and 126740 transitions. [2019-12-07 10:47:27,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 10:47:27,911 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-07 10:47:27,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:27,962 INFO L225 Difference]: With dead ends: 42398 [2019-12-07 10:47:27,962 INFO L226 Difference]: Without dead ends: 37900 [2019-12-07 10:47:27,963 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2019-12-07 10:47:28,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37900 states. [2019-12-07 10:47:28,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37900 to 21520. [2019-12-07 10:47:28,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21520 states. [2019-12-07 10:47:28,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21520 states to 21520 states and 65394 transitions. [2019-12-07 10:47:28,386 INFO L78 Accepts]: Start accepts. Automaton has 21520 states and 65394 transitions. Word has length 67 [2019-12-07 10:47:28,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:28,386 INFO L462 AbstractCegarLoop]: Abstraction has 21520 states and 65394 transitions. [2019-12-07 10:47:28,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 10:47:28,386 INFO L276 IsEmpty]: Start isEmpty. Operand 21520 states and 65394 transitions. [2019-12-07 10:47:28,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 10:47:28,405 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:28,405 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:47:28,406 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:47:28,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:28,406 INFO L82 PathProgramCache]: Analyzing trace with hash 20446903, now seen corresponding path program 3 times [2019-12-07 10:47:28,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:47:28,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207851453] [2019-12-07 10:47:28,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:47:28,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:28,630 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 10:47:28,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207851453] [2019-12-07 10:47:28,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:47:28,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 10:47:28,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301962821] [2019-12-07 10:47:28,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 10:47:28,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:47:28,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 10:47:28,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-07 10:47:28,631 INFO L87 Difference]: Start difference. First operand 21520 states and 65394 transitions. Second operand 14 states. [2019-12-07 10:47:29,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:29,936 INFO L93 Difference]: Finished difference Result 28471 states and 85303 transitions. [2019-12-07 10:47:29,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 10:47:29,936 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2019-12-07 10:47:29,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:29,963 INFO L225 Difference]: With dead ends: 28471 [2019-12-07 10:47:29,963 INFO L226 Difference]: Without dead ends: 25603 [2019-12-07 10:47:29,963 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=657, Unknown=0, NotChecked=0, Total=812 [2019-12-07 10:47:30,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25603 states. [2019-12-07 10:47:30,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25603 to 21340. [2019-12-07 10:47:30,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21340 states. [2019-12-07 10:47:30,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21340 states to 21340 states and 64873 transitions. [2019-12-07 10:47:30,279 INFO L78 Accepts]: Start accepts. Automaton has 21340 states and 64873 transitions. Word has length 67 [2019-12-07 10:47:30,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:30,279 INFO L462 AbstractCegarLoop]: Abstraction has 21340 states and 64873 transitions. [2019-12-07 10:47:30,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 10:47:30,279 INFO L276 IsEmpty]: Start isEmpty. Operand 21340 states and 64873 transitions. [2019-12-07 10:47:30,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 10:47:30,299 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:30,300 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:47:30,300 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:47:30,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:30,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1708150593, now seen corresponding path program 3 times [2019-12-07 10:47:30,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:47:30,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491807983] [2019-12-07 10:47:30,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:47:30,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:30,475 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 10:47:30,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491807983] [2019-12-07 10:47:30,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:47:30,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 10:47:30,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496868797] [2019-12-07 10:47:30,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 10:47:30,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:47:30,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 10:47:30,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-07 10:47:30,477 INFO L87 Difference]: Start difference. First operand 21340 states and 64873 transitions. Second operand 14 states. [2019-12-07 10:47:31,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:31,617 INFO L93 Difference]: Finished difference Result 44469 states and 133646 transitions. [2019-12-07 10:47:31,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-07 10:47:31,618 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2019-12-07 10:47:31,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:31,662 INFO L225 Difference]: With dead ends: 44469 [2019-12-07 10:47:31,663 INFO L226 Difference]: Without dead ends: 39532 [2019-12-07 10:47:31,663 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=241, Invalid=1319, Unknown=0, NotChecked=0, Total=1560 [2019-12-07 10:47:31,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39532 states. [2019-12-07 10:47:32,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39532 to 20761. [2019-12-07 10:47:32,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20761 states. [2019-12-07 10:47:32,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20761 states to 20761 states and 62860 transitions. [2019-12-07 10:47:32,068 INFO L78 Accepts]: Start accepts. Automaton has 20761 states and 62860 transitions. Word has length 67 [2019-12-07 10:47:32,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:32,068 INFO L462 AbstractCegarLoop]: Abstraction has 20761 states and 62860 transitions. [2019-12-07 10:47:32,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 10:47:32,068 INFO L276 IsEmpty]: Start isEmpty. Operand 20761 states and 62860 transitions. [2019-12-07 10:47:32,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 10:47:32,085 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:32,086 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:47:32,086 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:47:32,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:32,086 INFO L82 PathProgramCache]: Analyzing trace with hash 8805239, now seen corresponding path program 4 times [2019-12-07 10:47:32,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:47:32,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501135140] [2019-12-07 10:47:32,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:47:32,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:47:32,149 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 10:47:32,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501135140] [2019-12-07 10:47:32,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:47:32,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:47:32,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882731903] [2019-12-07 10:47:32,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:47:32,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:47:32,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:47:32,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:47:32,150 INFO L87 Difference]: Start difference. First operand 20761 states and 62860 transitions. Second operand 4 states. [2019-12-07 10:47:32,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:47:32,252 INFO L93 Difference]: Finished difference Result 20609 states and 62106 transitions. [2019-12-07 10:47:32,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:47:32,253 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-07 10:47:32,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:47:32,274 INFO L225 Difference]: With dead ends: 20609 [2019-12-07 10:47:32,275 INFO L226 Difference]: Without dead ends: 20441 [2019-12-07 10:47:32,275 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 3 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 10:47:32,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20441 states. [2019-12-07 10:47:32,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20441 to 19374. [2019-12-07 10:47:32,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19374 states. [2019-12-07 10:47:32,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19374 states to 19374 states and 58349 transitions. [2019-12-07 10:47:32,558 INFO L78 Accepts]: Start accepts. Automaton has 19374 states and 58349 transitions. Word has length 67 [2019-12-07 10:47:32,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:47:32,558 INFO L462 AbstractCegarLoop]: Abstraction has 19374 states and 58349 transitions. [2019-12-07 10:47:32,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:47:32,558 INFO L276 IsEmpty]: Start isEmpty. Operand 19374 states and 58349 transitions. [2019-12-07 10:47:32,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 10:47:32,574 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:47:32,574 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:47:32,575 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:47:32,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:47:32,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1080421452, now seen corresponding path program 1 times [2019-12-07 10:47:32,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:47:32,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59915473] [2019-12-07 10:47:32,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:47:32,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:47:32,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:47:32,655 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:47:32,655 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 10:47:32,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [891] [891] ULTIMATE.startENTRY-->L815: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2396~0.base_39| 4)) (= 0 v_~__unbuffered_p2_EAX~0_43) (= v_~y$r_buff1_thd1~0_178 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$w_buff1_used~0_439 0) (= v_~y$w_buff1~0_188 0) (= 0 v_~y$r_buff1_thd3~0_309) (= v_~y$read_delayed~0_7 0) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t2396~0.base_39| 1)) (= v_~y$r_buff1_thd0~0_201 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2396~0.base_39|)) (= v_~main$tmp_guard0~0_41 0) (= 0 v_~y$w_buff0~0_254) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2396~0.base_39| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2396~0.base_39|) |v_ULTIMATE.start_main_~#t2396~0.offset_26| 0)) |v_#memory_int_23|) (= 0 v_~y$r_buff0_thd3~0_343) (< 0 |v_#StackHeapBarrier_15|) (= v_~main$tmp_guard1~0_39 0) (= v_~__unbuffered_p2_EBX~0_50 0) (= 0 v_~y$flush_delayed~0_35) (= 0 v_~y$r_buff0_thd2~0_104) (= v_~weak$$choice2~0_129 0) (= 0 |v_#NULL.base_4|) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$r_buff0_thd0~0_134 0) (= 0 v_~weak$$choice0~0_22) (= v_~y$mem_tmp~0_24 0) (= v_~y$w_buff0_used~0_785 0) (= |v_#NULL.offset_4| 0) (= 0 v_~x~0_158) (= 0 v_~y$r_buff1_thd2~0_197) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t2396~0.base_39|) (= |v_ULTIMATE.start_main_~#t2396~0.offset_26| 0) (= v_~y~0_189 0) (= v_~y$r_buff0_thd1~0_218 0) (= v_~__unbuffered_cnt~0_118 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_785, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_133|, ULTIMATE.start_main_~#t2398~0.base=|v_ULTIMATE.start_main_~#t2398~0.base_27|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_293|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_39, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_104|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_47|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_178, ULTIMATE.start_main_~#t2396~0.base=|v_ULTIMATE.start_main_~#t2396~0.base_39|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_78|, ~y$mem_tmp~0=v_~y$mem_tmp~0_24, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_37|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_309, ~y$w_buff0~0=v_~y$w_buff0~0_254, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_343, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_218, ~y$flush_delayed~0=v_~y$flush_delayed~0_35, ULTIMATE.start_main_~#t2398~0.offset=|v_ULTIMATE.start_main_~#t2398~0.offset_20|, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_43, ~y~0=v_~y~0_189, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_50, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_18|, ULTIMATE.start_main_~#t2397~0.base=|v_ULTIMATE.start_main_~#t2397~0.base_37|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_41, ULTIMATE.start_main_~#t2397~0.offset=|v_ULTIMATE.start_main_~#t2397~0.offset_25|, #NULL.base=|v_#NULL.base_4|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_197, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ~y$w_buff1~0=v_~y$w_buff1~0_188, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_134, #valid=|v_#valid_72|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_104, #memory_int=|v_#memory_int_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_118, ~weak$$choice2~0=v_~weak$$choice2~0_129, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_201, ~x~0=v_~x~0_158, ULTIMATE.start_main_~#t2396~0.offset=|v_ULTIMATE.start_main_~#t2396~0.offset_26|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_439} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_~#t2398~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite50, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t2396~0.base, ULTIMATE.start_main_#t~ite52, ~y$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~y$r_buff1_thd3~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t2398~0.offset, #length, ~__unbuffered_p2_EAX~0, ~y~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_~#t2397~0.base, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_#t~nondet45, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2397~0.offset, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t2396~0.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 10:47:32,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] P0ENTRY-->L4-3: Formula: (and (= v_~y$w_buff1_used~0_76 v_~y$w_buff0_used~0_125) (= v_~y$w_buff0~0_37 v_~y$w_buff1~0_27) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_13 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_11|) (= v_~y$w_buff0_used~0_124 1) (= v_P0Thread1of1ForFork0_~arg.base_11 |v_P0Thread1of1ForFork0_#in~arg.base_13|) (= v_P0Thread1of1ForFork0_~arg.offset_11 |v_P0Thread1of1ForFork0_#in~arg.offset_13|) (= 1 v_~y$w_buff0~0_36) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_11| (ite (not (and (not (= 0 (mod v_~y$w_buff1_used~0_76 256))) (not (= (mod v_~y$w_buff0_used~0_124 256) 0)))) 1 0)) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_13 0))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_13|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_125, ~y$w_buff0~0=v_~y$w_buff0~0_37, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_13|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_13|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_124, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_36, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_13, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_13|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_11, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_11|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_11, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_76} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 10:47:32,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L815-1-->L817: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2397~0.base_11| 0)) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t2397~0.base_11|)) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t2397~0.base_11| 1)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2397~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2397~0.base_11|) |v_ULTIMATE.start_main_~#t2397~0.offset_10| 1)) |v_#memory_int_15|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2397~0.base_11| 4) |v_#length_17|) (= |v_ULTIMATE.start_main_~#t2397~0.offset_10| 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2397~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2397~0.base=|v_ULTIMATE.start_main_~#t2397~0.base_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2397~0.offset=|v_ULTIMATE.start_main_~#t2397~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2397~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2397~0.offset] because there is no mapped edge [2019-12-07 10:47:32,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L817-1-->L819: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2398~0.base_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2398~0.base_11| 4)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2398~0.base_11|)) (not (= 0 |v_ULTIMATE.start_main_~#t2398~0.base_11|)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2398~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t2398~0.offset_10|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2398~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2398~0.base_11|) |v_ULTIMATE.start_main_~#t2398~0.offset_10| 2)) |v_#memory_int_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2398~0.base=|v_ULTIMATE.start_main_~#t2398~0.base_11|, ULTIMATE.start_main_~#t2398~0.offset=|v_ULTIMATE.start_main_~#t2398~0.offset_10|, #length=|v_#length_15|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t2398~0.base, ULTIMATE.start_main_~#t2398~0.offset, #length] because there is no mapped edge [2019-12-07 10:47:32,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L782-->L782-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-535386570 256) 0))) (or (and (= ~y$w_buff1~0_In-535386570 |P2Thread1of1ForFork2_#t~ite24_Out-535386570|) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite23_In-535386570| |P2Thread1of1ForFork2_#t~ite23_Out-535386570|)) (and .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-535386570 256) 0))) (or (and .cse1 (= (mod ~y$r_buff1_thd3~0_In-535386570 256) 0)) (= (mod ~y$w_buff0_used~0_In-535386570 256) 0) (and .cse1 (= (mod ~y$w_buff1_used~0_In-535386570 256) 0)))) (= ~y$w_buff1~0_In-535386570 |P2Thread1of1ForFork2_#t~ite23_Out-535386570|) (= |P2Thread1of1ForFork2_#t~ite23_Out-535386570| |P2Thread1of1ForFork2_#t~ite24_Out-535386570|)))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In-535386570|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-535386570, ~y$w_buff1~0=~y$w_buff1~0_In-535386570, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-535386570, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-535386570, ~weak$$choice2~0=~weak$$choice2~0_In-535386570, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-535386570} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out-535386570|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out-535386570|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-535386570, ~y$w_buff1~0=~y$w_buff1~0_In-535386570, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-535386570, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-535386570, ~weak$$choice2~0=~weak$$choice2~0_In-535386570, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-535386570} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-07 10:47:32,662 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L783-->L783-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In439139011 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite27_Out439139011| ~y$w_buff0_used~0_In439139011) (= |P2Thread1of1ForFork2_#t~ite26_In439139011| |P2Thread1of1ForFork2_#t~ite26_Out439139011|)) (and (= |P2Thread1of1ForFork2_#t~ite27_Out439139011| |P2Thread1of1ForFork2_#t~ite26_Out439139011|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In439139011 256)))) (or (and (= (mod ~y$w_buff1_used~0_In439139011 256) 0) .cse1) (and .cse1 (= (mod ~y$r_buff1_thd3~0_In439139011 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In439139011 256)))) (= |P2Thread1of1ForFork2_#t~ite26_Out439139011| ~y$w_buff0_used~0_In439139011) .cse0))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In439139011, P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In439139011|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In439139011, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In439139011, ~weak$$choice2~0=~weak$$choice2~0_In439139011, ~y$w_buff1_used~0=~y$w_buff1_used~0_In439139011} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out439139011|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In439139011, ~y$w_buff0_used~0=~y$w_buff0_used~0_In439139011, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In439139011, ~weak$$choice2~0=~weak$$choice2~0_In439139011, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out439139011|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In439139011} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-07 10:47:32,662 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L784-->L784-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-705899353 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite30_Out-705899353| |P2Thread1of1ForFork2_#t~ite29_Out-705899353|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-705899353 256)))) (or (= (mod ~y$w_buff0_used~0_In-705899353 256) 0) (and (= 0 (mod ~y$r_buff1_thd3~0_In-705899353 256)) .cse0) (and (= (mod ~y$w_buff1_used~0_In-705899353 256) 0) .cse0))) .cse1 (= |P2Thread1of1ForFork2_#t~ite29_Out-705899353| ~y$w_buff1_used~0_In-705899353)) (and (= |P2Thread1of1ForFork2_#t~ite30_Out-705899353| ~y$w_buff1_used~0_In-705899353) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite29_In-705899353| |P2Thread1of1ForFork2_#t~ite29_Out-705899353|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-705899353, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-705899353, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-705899353, ~weak$$choice2~0=~weak$$choice2~0_In-705899353, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_In-705899353|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-705899353} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-705899353, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-705899353, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out-705899353|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-705899353, ~weak$$choice2~0=~weak$$choice2~0_In-705899353, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-705899353|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-705899353} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 10:47:32,663 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L785-->L786: Formula: (and (= v_~y$r_buff0_thd3~0_93 v_~y$r_buff0_thd3~0_92) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_93, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_6|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_7|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_92, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_8|, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, ~y$r_buff0_thd3~0, P2Thread1of1ForFork2_#t~ite32] because there is no mapped edge [2019-12-07 10:47:32,663 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] L788-->L792: Formula: (and (= v_~y~0_52 v_~y$mem_tmp~0_5) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= 0 v_~y$flush_delayed~0_6)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7} OutVars{P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_5|, ~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~y~0=v_~y~0_52} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-07 10:47:32,664 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L792-2-->L792-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd3~0_In-519246550 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-519246550 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite38_Out-519246550| ~y~0_In-519246550)) (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite38_Out-519246550| ~y$w_buff1~0_In-519246550) (not .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-519246550, ~y$w_buff1~0=~y$w_buff1~0_In-519246550, ~y~0=~y~0_In-519246550, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-519246550} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-519246550, ~y$w_buff1~0=~y$w_buff1~0_In-519246550, ~y~0=~y~0_In-519246550, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out-519246550|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-519246550} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-07 10:47:32,664 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L743-->L743-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-892328874 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-892328874 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-892328874| ~y$w_buff0_used~0_In-892328874) (or .cse0 .cse1)) (and (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-892328874| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-892328874, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-892328874} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-892328874|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-892328874, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-892328874} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 10:47:32,664 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [816] [816] L744-->L744-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In953022006 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In953022006 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In953022006 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In953022006 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out953022006|)) (and (= ~y$w_buff1_used~0_In953022006 |P0Thread1of1ForFork0_#t~ite6_Out953022006|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In953022006, ~y$w_buff0_used~0=~y$w_buff0_used~0_In953022006, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In953022006, ~y$w_buff1_used~0=~y$w_buff1_used~0_In953022006} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out953022006|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In953022006, ~y$w_buff0_used~0=~y$w_buff0_used~0_In953022006, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In953022006, ~y$w_buff1_used~0=~y$w_buff1_used~0_In953022006} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 10:47:32,665 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L759-2-->L759-5: Formula: (let ((.cse1 (= |P1Thread1of1ForFork1_#t~ite9_Out107495577| |P1Thread1of1ForFork1_#t~ite10_Out107495577|)) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In107495577 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In107495577 256) 0))) (or (and (not .cse0) .cse1 (not .cse2) (= |P1Thread1of1ForFork1_#t~ite9_Out107495577| ~y$w_buff1~0_In107495577)) (and .cse1 (or .cse2 .cse0) (= |P1Thread1of1ForFork1_#t~ite9_Out107495577| ~y~0_In107495577)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In107495577, ~y$w_buff1~0=~y$w_buff1~0_In107495577, ~y~0=~y~0_In107495577, ~y$w_buff1_used~0=~y$w_buff1_used~0_In107495577} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In107495577, ~y$w_buff1~0=~y$w_buff1~0_In107495577, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out107495577|, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out107495577|, ~y~0=~y~0_In107495577, ~y$w_buff1_used~0=~y$w_buff1_used~0_In107495577} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-07 10:47:32,665 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L792-4-->L793: Formula: (= v_~y~0_32 |v_P2Thread1of1ForFork2_#t~ite38_10|) InVars {P2Thread1of1ForFork2_#t~ite38=|v_P2Thread1of1ForFork2_#t~ite38_10|} OutVars{~y~0=v_~y~0_32, P2Thread1of1ForFork2_#t~ite39=|v_P2Thread1of1ForFork2_#t~ite39_5|, P2Thread1of1ForFork2_#t~ite38=|v_P2Thread1of1ForFork2_#t~ite38_9|} AuxVars[] AssignedVars[~y~0, P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-07 10:47:32,665 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L793-->L793-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-938165997 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-938165997 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite40_Out-938165997| 0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite40_Out-938165997| ~y$w_buff0_used~0_In-938165997) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-938165997, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-938165997} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-938165997, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-938165997, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out-938165997|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-07 10:47:32,665 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L794-->L794-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In-626395380 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd3~0_In-626395380 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-626395380 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-626395380 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite41_Out-626395380| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite41_Out-626395380| ~y$w_buff1_used~0_In-626395380)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-626395380, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-626395380, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-626395380, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-626395380} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-626395380, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-626395380, P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out-626395380|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-626395380, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-626395380} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-07 10:47:32,666 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L795-->L795-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-1037506380 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1037506380 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite42_Out-1037506380|)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite42_Out-1037506380| ~y$r_buff0_thd3~0_In-1037506380)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1037506380, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1037506380} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1037506380, P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out-1037506380|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1037506380} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-07 10:47:32,666 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L796-->L796-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-339371942 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-339371942 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-339371942 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd3~0_In-339371942 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite43_Out-339371942|)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~y$r_buff1_thd3~0_In-339371942 |P2Thread1of1ForFork2_#t~ite43_Out-339371942|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-339371942, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-339371942, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-339371942, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-339371942} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-339371942, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-339371942, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-339371942, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out-339371942|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-339371942} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-07 10:47:32,666 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L745-->L746: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In492913717 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In492913717 256))) (.cse2 (= ~y$r_buff0_thd1~0_Out492913717 ~y$r_buff0_thd1~0_In492913717))) (or (and (= 0 ~y$r_buff0_thd1~0_Out492913717) (not .cse0) (not .cse1)) (and .cse1 .cse2) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In492913717, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In492913717} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In492913717, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out492913717|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out492913717} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 10:47:32,666 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L746-->L746-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In-703850914 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-703850914 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-703850914 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In-703850914 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out-703850914| 0)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-703850914| ~y$r_buff1_thd1~0_In-703850914) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-703850914, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-703850914, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-703850914, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-703850914} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-703850914, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-703850914, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-703850914|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-703850914, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-703850914} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 10:47:32,666 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L746-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_95 |v_P0Thread1of1ForFork0_#t~ite8_36|) (= v_~__unbuffered_cnt~0_73 (+ v_~__unbuffered_cnt~0_74 1)) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_95, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_35|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73} 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 10:47:32,667 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [863] [863] L796-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= |v_P2Thread1of1ForFork2_#t~ite43_32| v_~y$r_buff1_thd3~0_152)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_152, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_31|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 10:47:32,667 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L760-->L760-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-1866480703 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1866480703 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out-1866480703| ~y$w_buff0_used~0_In-1866480703) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-1866480703| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1866480703, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1866480703} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1866480703, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1866480703, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1866480703|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-07 10:47:32,667 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L761-->L761-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In16129428 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In16129428 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In16129428 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In16129428 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out16129428|)) (and (= ~y$w_buff1_used~0_In16129428 |P1Thread1of1ForFork1_#t~ite12_Out16129428|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In16129428, ~y$w_buff0_used~0=~y$w_buff0_used~0_In16129428, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In16129428, ~y$w_buff1_used~0=~y$w_buff1_used~0_In16129428} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In16129428, ~y$w_buff0_used~0=~y$w_buff0_used~0_In16129428, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In16129428, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out16129428|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In16129428} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 10:47:32,668 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L762-->L762-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1961689972 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1961689972 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite13_Out-1961689972| ~y$r_buff0_thd2~0_In-1961689972)) (and (= 0 |P1Thread1of1ForFork1_#t~ite13_Out-1961689972|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1961689972, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1961689972} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1961689972, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1961689972, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1961689972|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-07 10:47:32,668 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L763-->L763-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In1807078712 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In1807078712 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1807078712 256))) (.cse0 (= (mod ~y$r_buff1_thd2~0_In1807078712 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite14_Out1807078712| ~y$r_buff1_thd2~0_In1807078712)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out1807078712|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1807078712, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1807078712, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1807078712, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1807078712} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1807078712, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1807078712, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1807078712, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1807078712|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1807078712} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 10:47:32,668 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L763-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1)) (= v_~y$r_buff1_thd2~0_109 |v_P1Thread1of1ForFork1_#t~ite14_30|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_30|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_109, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_29|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 10:47:32,669 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L823-->L825-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_137 256) 0) (= 0 (mod v_~y$r_buff0_thd0~0_31 256))) (not (= (mod v_~main$tmp_guard0~0_4 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_31, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_31, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 10:47:32,669 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L825-2-->L825-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In682230208 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In682230208 256)))) (or (and (or .cse0 .cse1) (= ~y~0_In682230208 |ULTIMATE.start_main_#t~ite47_Out682230208|)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite47_Out682230208| ~y$w_buff1~0_In682230208)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In682230208, ~y~0=~y~0_In682230208, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In682230208, ~y$w_buff1_used~0=~y$w_buff1_used~0_In682230208} OutVars{~y$w_buff1~0=~y$w_buff1~0_In682230208, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out682230208|, ~y~0=~y~0_In682230208, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In682230208, ~y$w_buff1_used~0=~y$w_buff1_used~0_In682230208} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-07 10:47:32,669 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L825-4-->L826: Formula: (= v_~y~0_31 |v_ULTIMATE.start_main_#t~ite47_11|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_17|, ~y~0=v_~y~0_31} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48, ~y~0] because there is no mapped edge [2019-12-07 10:47:32,669 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L826-->L826-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1655012963 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1655012963 256)))) (or (and (= ~y$w_buff0_used~0_In1655012963 |ULTIMATE.start_main_#t~ite49_Out1655012963|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite49_Out1655012963|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1655012963, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1655012963} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1655012963, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1655012963, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1655012963|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-07 10:47:32,669 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L827-->L827-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-1907859311 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-1907859311 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-1907859311 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1907859311 256)))) (or (and (= |ULTIMATE.start_main_#t~ite50_Out-1907859311| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~y$w_buff1_used~0_In-1907859311 |ULTIMATE.start_main_#t~ite50_Out-1907859311|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1907859311, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1907859311, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1907859311, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1907859311} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1907859311|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1907859311, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1907859311, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1907859311, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1907859311} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-07 10:47:32,670 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L828-->L828-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In2081850379 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In2081850379 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out2081850379|) (not .cse1)) (and (= ~y$r_buff0_thd0~0_In2081850379 |ULTIMATE.start_main_#t~ite51_Out2081850379|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2081850379, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2081850379} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out2081850379|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2081850379, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2081850379} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-07 10:47:32,670 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L829-->L829-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-2119955617 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-2119955617 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-2119955617 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-2119955617 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite52_Out-2119955617| ~y$r_buff1_thd0~0_In-2119955617)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite52_Out-2119955617| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2119955617, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2119955617, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2119955617, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2119955617} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-2119955617|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2119955617, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2119955617, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2119955617, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2119955617} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-07 10:47:32,670 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L829-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~main$tmp_guard1~0_18 (ite (= 0 (ite (not (and (= 2 v_~x~0_130) (= 2 v_~__unbuffered_p2_EAX~0_23) (= v_~__unbuffered_p2_EBX~0_31 0))) 1 0)) 0 1)) (= v_~y$r_buff1_thd0~0_163 |v_ULTIMATE.start_main_#t~ite52_41|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_18 256))) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_41|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_31, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_130} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_40|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_31, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_130, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_163, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 10:47:32,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 10:47:32 BasicIcfg [2019-12-07 10:47:32,720 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 10:47:32,720 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 10:47:32,720 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 10:47:32,720 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 10:47:32,721 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:46:38" (3/4) ... [2019-12-07 10:47:32,722 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 10:47:32,722 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [891] [891] ULTIMATE.startENTRY-->L815: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2396~0.base_39| 4)) (= 0 v_~__unbuffered_p2_EAX~0_43) (= v_~y$r_buff1_thd1~0_178 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$w_buff1_used~0_439 0) (= v_~y$w_buff1~0_188 0) (= 0 v_~y$r_buff1_thd3~0_309) (= v_~y$read_delayed~0_7 0) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t2396~0.base_39| 1)) (= v_~y$r_buff1_thd0~0_201 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2396~0.base_39|)) (= v_~main$tmp_guard0~0_41 0) (= 0 v_~y$w_buff0~0_254) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2396~0.base_39| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2396~0.base_39|) |v_ULTIMATE.start_main_~#t2396~0.offset_26| 0)) |v_#memory_int_23|) (= 0 v_~y$r_buff0_thd3~0_343) (< 0 |v_#StackHeapBarrier_15|) (= v_~main$tmp_guard1~0_39 0) (= v_~__unbuffered_p2_EBX~0_50 0) (= 0 v_~y$flush_delayed~0_35) (= 0 v_~y$r_buff0_thd2~0_104) (= v_~weak$$choice2~0_129 0) (= 0 |v_#NULL.base_4|) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$r_buff0_thd0~0_134 0) (= 0 v_~weak$$choice0~0_22) (= v_~y$mem_tmp~0_24 0) (= v_~y$w_buff0_used~0_785 0) (= |v_#NULL.offset_4| 0) (= 0 v_~x~0_158) (= 0 v_~y$r_buff1_thd2~0_197) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t2396~0.base_39|) (= |v_ULTIMATE.start_main_~#t2396~0.offset_26| 0) (= v_~y~0_189 0) (= v_~y$r_buff0_thd1~0_218 0) (= v_~__unbuffered_cnt~0_118 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_785, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_133|, ULTIMATE.start_main_~#t2398~0.base=|v_ULTIMATE.start_main_~#t2398~0.base_27|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_293|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_39, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_104|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_47|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_178, ULTIMATE.start_main_~#t2396~0.base=|v_ULTIMATE.start_main_~#t2396~0.base_39|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_78|, ~y$mem_tmp~0=v_~y$mem_tmp~0_24, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_37|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_309, ~y$w_buff0~0=v_~y$w_buff0~0_254, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_343, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_218, ~y$flush_delayed~0=v_~y$flush_delayed~0_35, ULTIMATE.start_main_~#t2398~0.offset=|v_ULTIMATE.start_main_~#t2398~0.offset_20|, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_43, ~y~0=v_~y~0_189, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_50, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_18|, ULTIMATE.start_main_~#t2397~0.base=|v_ULTIMATE.start_main_~#t2397~0.base_37|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_41, ULTIMATE.start_main_~#t2397~0.offset=|v_ULTIMATE.start_main_~#t2397~0.offset_25|, #NULL.base=|v_#NULL.base_4|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_197, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ~y$w_buff1~0=v_~y$w_buff1~0_188, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_134, #valid=|v_#valid_72|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_104, #memory_int=|v_#memory_int_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_118, ~weak$$choice2~0=v_~weak$$choice2~0_129, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_201, ~x~0=v_~x~0_158, ULTIMATE.start_main_~#t2396~0.offset=|v_ULTIMATE.start_main_~#t2396~0.offset_26|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_439} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_~#t2398~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite50, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t2396~0.base, ULTIMATE.start_main_#t~ite52, ~y$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~y$r_buff1_thd3~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t2398~0.offset, #length, ~__unbuffered_p2_EAX~0, ~y~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_~#t2397~0.base, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_#t~nondet45, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2397~0.offset, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t2396~0.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 10:47:32,723 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] P0ENTRY-->L4-3: Formula: (and (= v_~y$w_buff1_used~0_76 v_~y$w_buff0_used~0_125) (= v_~y$w_buff0~0_37 v_~y$w_buff1~0_27) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_13 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_11|) (= v_~y$w_buff0_used~0_124 1) (= v_P0Thread1of1ForFork0_~arg.base_11 |v_P0Thread1of1ForFork0_#in~arg.base_13|) (= v_P0Thread1of1ForFork0_~arg.offset_11 |v_P0Thread1of1ForFork0_#in~arg.offset_13|) (= 1 v_~y$w_buff0~0_36) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_11| (ite (not (and (not (= 0 (mod v_~y$w_buff1_used~0_76 256))) (not (= (mod v_~y$w_buff0_used~0_124 256) 0)))) 1 0)) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_13 0))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_13|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_125, ~y$w_buff0~0=v_~y$w_buff0~0_37, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_13|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_13|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_124, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_36, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_13, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_13|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_11, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_11|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_11, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_76} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 10:47:32,723 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L815-1-->L817: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2397~0.base_11| 0)) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t2397~0.base_11|)) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t2397~0.base_11| 1)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2397~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2397~0.base_11|) |v_ULTIMATE.start_main_~#t2397~0.offset_10| 1)) |v_#memory_int_15|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2397~0.base_11| 4) |v_#length_17|) (= |v_ULTIMATE.start_main_~#t2397~0.offset_10| 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2397~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2397~0.base=|v_ULTIMATE.start_main_~#t2397~0.base_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2397~0.offset=|v_ULTIMATE.start_main_~#t2397~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2397~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2397~0.offset] because there is no mapped edge [2019-12-07 10:47:32,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L817-1-->L819: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2398~0.base_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2398~0.base_11| 4)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2398~0.base_11|)) (not (= 0 |v_ULTIMATE.start_main_~#t2398~0.base_11|)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2398~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t2398~0.offset_10|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2398~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2398~0.base_11|) |v_ULTIMATE.start_main_~#t2398~0.offset_10| 2)) |v_#memory_int_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2398~0.base=|v_ULTIMATE.start_main_~#t2398~0.base_11|, ULTIMATE.start_main_~#t2398~0.offset=|v_ULTIMATE.start_main_~#t2398~0.offset_10|, #length=|v_#length_15|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t2398~0.base, ULTIMATE.start_main_~#t2398~0.offset, #length] because there is no mapped edge [2019-12-07 10:47:32,725 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L782-->L782-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-535386570 256) 0))) (or (and (= ~y$w_buff1~0_In-535386570 |P2Thread1of1ForFork2_#t~ite24_Out-535386570|) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite23_In-535386570| |P2Thread1of1ForFork2_#t~ite23_Out-535386570|)) (and .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-535386570 256) 0))) (or (and .cse1 (= (mod ~y$r_buff1_thd3~0_In-535386570 256) 0)) (= (mod ~y$w_buff0_used~0_In-535386570 256) 0) (and .cse1 (= (mod ~y$w_buff1_used~0_In-535386570 256) 0)))) (= ~y$w_buff1~0_In-535386570 |P2Thread1of1ForFork2_#t~ite23_Out-535386570|) (= |P2Thread1of1ForFork2_#t~ite23_Out-535386570| |P2Thread1of1ForFork2_#t~ite24_Out-535386570|)))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In-535386570|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-535386570, ~y$w_buff1~0=~y$w_buff1~0_In-535386570, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-535386570, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-535386570, ~weak$$choice2~0=~weak$$choice2~0_In-535386570, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-535386570} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out-535386570|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out-535386570|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-535386570, ~y$w_buff1~0=~y$w_buff1~0_In-535386570, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-535386570, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-535386570, ~weak$$choice2~0=~weak$$choice2~0_In-535386570, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-535386570} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-07 10:47:32,726 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L783-->L783-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In439139011 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite27_Out439139011| ~y$w_buff0_used~0_In439139011) (= |P2Thread1of1ForFork2_#t~ite26_In439139011| |P2Thread1of1ForFork2_#t~ite26_Out439139011|)) (and (= |P2Thread1of1ForFork2_#t~ite27_Out439139011| |P2Thread1of1ForFork2_#t~ite26_Out439139011|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In439139011 256)))) (or (and (= (mod ~y$w_buff1_used~0_In439139011 256) 0) .cse1) (and .cse1 (= (mod ~y$r_buff1_thd3~0_In439139011 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In439139011 256)))) (= |P2Thread1of1ForFork2_#t~ite26_Out439139011| ~y$w_buff0_used~0_In439139011) .cse0))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In439139011, P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In439139011|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In439139011, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In439139011, ~weak$$choice2~0=~weak$$choice2~0_In439139011, ~y$w_buff1_used~0=~y$w_buff1_used~0_In439139011} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out439139011|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In439139011, ~y$w_buff0_used~0=~y$w_buff0_used~0_In439139011, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In439139011, ~weak$$choice2~0=~weak$$choice2~0_In439139011, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out439139011|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In439139011} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-07 10:47:32,726 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L784-->L784-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-705899353 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite30_Out-705899353| |P2Thread1of1ForFork2_#t~ite29_Out-705899353|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-705899353 256)))) (or (= (mod ~y$w_buff0_used~0_In-705899353 256) 0) (and (= 0 (mod ~y$r_buff1_thd3~0_In-705899353 256)) .cse0) (and (= (mod ~y$w_buff1_used~0_In-705899353 256) 0) .cse0))) .cse1 (= |P2Thread1of1ForFork2_#t~ite29_Out-705899353| ~y$w_buff1_used~0_In-705899353)) (and (= |P2Thread1of1ForFork2_#t~ite30_Out-705899353| ~y$w_buff1_used~0_In-705899353) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite29_In-705899353| |P2Thread1of1ForFork2_#t~ite29_Out-705899353|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-705899353, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-705899353, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-705899353, ~weak$$choice2~0=~weak$$choice2~0_In-705899353, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_In-705899353|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-705899353} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-705899353, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-705899353, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out-705899353|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-705899353, ~weak$$choice2~0=~weak$$choice2~0_In-705899353, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-705899353|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-705899353} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 10:47:32,727 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L785-->L786: Formula: (and (= v_~y$r_buff0_thd3~0_93 v_~y$r_buff0_thd3~0_92) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_93, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_6|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_7|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_92, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_8|, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, ~y$r_buff0_thd3~0, P2Thread1of1ForFork2_#t~ite32] because there is no mapped edge [2019-12-07 10:47:32,727 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] L788-->L792: Formula: (and (= v_~y~0_52 v_~y$mem_tmp~0_5) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= 0 v_~y$flush_delayed~0_6)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7} OutVars{P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_5|, ~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~y~0=v_~y~0_52} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-07 10:47:32,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L792-2-->L792-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd3~0_In-519246550 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-519246550 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite38_Out-519246550| ~y~0_In-519246550)) (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite38_Out-519246550| ~y$w_buff1~0_In-519246550) (not .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-519246550, ~y$w_buff1~0=~y$w_buff1~0_In-519246550, ~y~0=~y~0_In-519246550, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-519246550} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-519246550, ~y$w_buff1~0=~y$w_buff1~0_In-519246550, ~y~0=~y~0_In-519246550, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out-519246550|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-519246550} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-07 10:47:32,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L743-->L743-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-892328874 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-892328874 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-892328874| ~y$w_buff0_used~0_In-892328874) (or .cse0 .cse1)) (and (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-892328874| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-892328874, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-892328874} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-892328874|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-892328874, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-892328874} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 10:47:32,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [816] [816] L744-->L744-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In953022006 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In953022006 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In953022006 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd1~0_In953022006 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out953022006|)) (and (= ~y$w_buff1_used~0_In953022006 |P0Thread1of1ForFork0_#t~ite6_Out953022006|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In953022006, ~y$w_buff0_used~0=~y$w_buff0_used~0_In953022006, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In953022006, ~y$w_buff1_used~0=~y$w_buff1_used~0_In953022006} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out953022006|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In953022006, ~y$w_buff0_used~0=~y$w_buff0_used~0_In953022006, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In953022006, ~y$w_buff1_used~0=~y$w_buff1_used~0_In953022006} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 10:47:32,729 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L759-2-->L759-5: Formula: (let ((.cse1 (= |P1Thread1of1ForFork1_#t~ite9_Out107495577| |P1Thread1of1ForFork1_#t~ite10_Out107495577|)) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In107495577 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In107495577 256) 0))) (or (and (not .cse0) .cse1 (not .cse2) (= |P1Thread1of1ForFork1_#t~ite9_Out107495577| ~y$w_buff1~0_In107495577)) (and .cse1 (or .cse2 .cse0) (= |P1Thread1of1ForFork1_#t~ite9_Out107495577| ~y~0_In107495577)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In107495577, ~y$w_buff1~0=~y$w_buff1~0_In107495577, ~y~0=~y~0_In107495577, ~y$w_buff1_used~0=~y$w_buff1_used~0_In107495577} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In107495577, ~y$w_buff1~0=~y$w_buff1~0_In107495577, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out107495577|, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out107495577|, ~y~0=~y~0_In107495577, ~y$w_buff1_used~0=~y$w_buff1_used~0_In107495577} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-07 10:47:32,729 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L792-4-->L793: Formula: (= v_~y~0_32 |v_P2Thread1of1ForFork2_#t~ite38_10|) InVars {P2Thread1of1ForFork2_#t~ite38=|v_P2Thread1of1ForFork2_#t~ite38_10|} OutVars{~y~0=v_~y~0_32, P2Thread1of1ForFork2_#t~ite39=|v_P2Thread1of1ForFork2_#t~ite39_5|, P2Thread1of1ForFork2_#t~ite38=|v_P2Thread1of1ForFork2_#t~ite38_9|} AuxVars[] AssignedVars[~y~0, P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-07 10:47:32,729 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L793-->L793-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-938165997 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-938165997 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite40_Out-938165997| 0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite40_Out-938165997| ~y$w_buff0_used~0_In-938165997) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-938165997, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-938165997} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-938165997, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-938165997, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out-938165997|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-07 10:47:32,729 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L794-->L794-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In-626395380 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd3~0_In-626395380 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-626395380 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-626395380 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite41_Out-626395380| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite41_Out-626395380| ~y$w_buff1_used~0_In-626395380)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-626395380, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-626395380, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-626395380, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-626395380} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-626395380, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-626395380, P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out-626395380|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-626395380, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-626395380} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-07 10:47:32,730 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L795-->L795-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-1037506380 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1037506380 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite42_Out-1037506380|)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite42_Out-1037506380| ~y$r_buff0_thd3~0_In-1037506380)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1037506380, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1037506380} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1037506380, P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out-1037506380|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1037506380} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-07 10:47:32,730 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L796-->L796-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-339371942 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-339371942 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-339371942 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd3~0_In-339371942 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite43_Out-339371942|)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~y$r_buff1_thd3~0_In-339371942 |P2Thread1of1ForFork2_#t~ite43_Out-339371942|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-339371942, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-339371942, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-339371942, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-339371942} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-339371942, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-339371942, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-339371942, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out-339371942|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-339371942} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-07 10:47:32,730 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L745-->L746: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In492913717 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In492913717 256))) (.cse2 (= ~y$r_buff0_thd1~0_Out492913717 ~y$r_buff0_thd1~0_In492913717))) (or (and (= 0 ~y$r_buff0_thd1~0_Out492913717) (not .cse0) (not .cse1)) (and .cse1 .cse2) (and .cse0 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In492913717, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In492913717} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In492913717, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out492913717|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out492913717} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 10:47:32,730 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L746-->L746-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In-703850914 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-703850914 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-703850914 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In-703850914 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out-703850914| 0)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-703850914| ~y$r_buff1_thd1~0_In-703850914) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-703850914, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-703850914, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-703850914, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-703850914} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-703850914, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-703850914, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-703850914|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-703850914, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-703850914} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 10:47:32,730 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L746-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_95 |v_P0Thread1of1ForFork0_#t~ite8_36|) (= v_~__unbuffered_cnt~0_73 (+ v_~__unbuffered_cnt~0_74 1)) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_95, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_35|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73} 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 10:47:32,730 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [863] [863] L796-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= |v_P2Thread1of1ForFork2_#t~ite43_32| v_~y$r_buff1_thd3~0_152)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_152, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_31|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 10:47:32,731 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L760-->L760-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-1866480703 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1866480703 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out-1866480703| ~y$w_buff0_used~0_In-1866480703) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-1866480703| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1866480703, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1866480703} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1866480703, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1866480703, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1866480703|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-07 10:47:32,731 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L761-->L761-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In16129428 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In16129428 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In16129428 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In16129428 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out16129428|)) (and (= ~y$w_buff1_used~0_In16129428 |P1Thread1of1ForFork1_#t~ite12_Out16129428|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In16129428, ~y$w_buff0_used~0=~y$w_buff0_used~0_In16129428, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In16129428, ~y$w_buff1_used~0=~y$w_buff1_used~0_In16129428} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In16129428, ~y$w_buff0_used~0=~y$w_buff0_used~0_In16129428, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In16129428, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out16129428|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In16129428} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 10:47:32,731 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L762-->L762-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1961689972 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1961689972 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite13_Out-1961689972| ~y$r_buff0_thd2~0_In-1961689972)) (and (= 0 |P1Thread1of1ForFork1_#t~ite13_Out-1961689972|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1961689972, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1961689972} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1961689972, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1961689972, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1961689972|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-07 10:47:32,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L763-->L763-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In1807078712 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In1807078712 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1807078712 256))) (.cse0 (= (mod ~y$r_buff1_thd2~0_In1807078712 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite14_Out1807078712| ~y$r_buff1_thd2~0_In1807078712)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out1807078712|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1807078712, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1807078712, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1807078712, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1807078712} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1807078712, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1807078712, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1807078712, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1807078712|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1807078712} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 10:47:32,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L763-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1)) (= v_~y$r_buff1_thd2~0_109 |v_P1Thread1of1ForFork1_#t~ite14_30|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_30|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_109, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_29|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 10:47:32,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L823-->L825-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_137 256) 0) (= 0 (mod v_~y$r_buff0_thd0~0_31 256))) (not (= (mod v_~main$tmp_guard0~0_4 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_31, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_31, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 10:47:32,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L825-2-->L825-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In682230208 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In682230208 256)))) (or (and (or .cse0 .cse1) (= ~y~0_In682230208 |ULTIMATE.start_main_#t~ite47_Out682230208|)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite47_Out682230208| ~y$w_buff1~0_In682230208)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In682230208, ~y~0=~y~0_In682230208, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In682230208, ~y$w_buff1_used~0=~y$w_buff1_used~0_In682230208} OutVars{~y$w_buff1~0=~y$w_buff1~0_In682230208, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out682230208|, ~y~0=~y~0_In682230208, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In682230208, ~y$w_buff1_used~0=~y$w_buff1_used~0_In682230208} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-07 10:47:32,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L825-4-->L826: Formula: (= v_~y~0_31 |v_ULTIMATE.start_main_#t~ite47_11|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_17|, ~y~0=v_~y~0_31} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48, ~y~0] because there is no mapped edge [2019-12-07 10:47:32,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L826-->L826-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1655012963 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1655012963 256)))) (or (and (= ~y$w_buff0_used~0_In1655012963 |ULTIMATE.start_main_#t~ite49_Out1655012963|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite49_Out1655012963|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1655012963, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1655012963} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1655012963, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1655012963, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1655012963|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-07 10:47:32,733 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L827-->L827-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-1907859311 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-1907859311 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-1907859311 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1907859311 256)))) (or (and (= |ULTIMATE.start_main_#t~ite50_Out-1907859311| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~y$w_buff1_used~0_In-1907859311 |ULTIMATE.start_main_#t~ite50_Out-1907859311|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1907859311, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1907859311, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1907859311, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1907859311} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1907859311|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1907859311, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1907859311, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1907859311, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1907859311} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-07 10:47:32,733 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L828-->L828-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In2081850379 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In2081850379 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out2081850379|) (not .cse1)) (and (= ~y$r_buff0_thd0~0_In2081850379 |ULTIMATE.start_main_#t~ite51_Out2081850379|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2081850379, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2081850379} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out2081850379|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2081850379, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2081850379} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-07 10:47:32,734 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L829-->L829-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-2119955617 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-2119955617 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-2119955617 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-2119955617 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite52_Out-2119955617| ~y$r_buff1_thd0~0_In-2119955617)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite52_Out-2119955617| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2119955617, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2119955617, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2119955617, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2119955617} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-2119955617|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2119955617, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2119955617, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2119955617, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2119955617} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-07 10:47:32,734 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L829-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~main$tmp_guard1~0_18 (ite (= 0 (ite (not (and (= 2 v_~x~0_130) (= 2 v_~__unbuffered_p2_EAX~0_23) (= v_~__unbuffered_p2_EBX~0_31 0))) 1 0)) 0 1)) (= v_~y$r_buff1_thd0~0_163 |v_ULTIMATE.start_main_#t~ite52_41|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_18 256))) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_41|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_31, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_130} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_40|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_31, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_130, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_163, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 10:47:32,789 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_0c6f765a-3f85-4118-a40a-52a508a2bf96/bin/uautomizer/witness.graphml [2019-12-07 10:47:32,789 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 10:47:32,790 INFO L168 Benchmark]: Toolchain (without parser) took 54686.70 ms. Allocated memory was 1.0 GB in the beginning and 5.6 GB in the end (delta: 4.6 GB). Free memory was 938.2 MB in the beginning and 2.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. [2019-12-07 10:47:32,790 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 958.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:47:32,790 INFO L168 Benchmark]: CACSL2BoogieTranslator took 379.19 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 92.3 MB). Free memory was 938.2 MB in the beginning and 1.1 GB in the end (delta: -124.3 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-12-07 10:47:32,791 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.78 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 10:47:32,791 INFO L168 Benchmark]: Boogie Preprocessor took 24.80 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 10:47:32,791 INFO L168 Benchmark]: RCFGBuilder took 414.06 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: 56.3 MB). Peak memory consumption was 56.3 MB. Max. memory is 11.5 GB. [2019-12-07 10:47:32,791 INFO L168 Benchmark]: TraceAbstraction took 53760.86 ms. Allocated memory was 1.1 GB in the beginning and 5.6 GB in the end (delta: 4.5 GB). Free memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. [2019-12-07 10:47:32,792 INFO L168 Benchmark]: Witness Printer took 68.91 ms. Allocated memory is still 5.6 GB. Free memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 11.5 GB. [2019-12-07 10:47:32,793 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 958.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 379.19 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 92.3 MB). Free memory was 938.2 MB in the beginning and 1.1 GB in the end (delta: -124.3 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.78 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 24.80 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 414.06 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: 56.3 MB). Peak memory consumption was 56.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 53760.86 ms. Allocated memory was 1.1 GB in the beginning and 5.6 GB in the end (delta: 4.5 GB). Free memory was 1.0 GB in the beginning and 2.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. * Witness Printer took 68.91 ms. Allocated memory is still 5.6 GB. Free memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: 17.1 MB). Peak memory consumption was 17.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.3s, 174 ProgramPointsBefore, 93 ProgramPointsAfterwards, 211 TransitionsBefore, 103 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 31 ChoiceCompositions, 6738 VarBasedMoverChecksPositive, 252 VarBasedMoverChecksNegative, 75 SemBasedMoverChecksPositive, 241 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.8s, 0 MoverChecksTotal, 78269 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L815] FCALL, FORK 0 pthread_create(&t2396, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L732] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L733] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L734] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L735] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L736] 1 y$r_buff0_thd1 = (_Bool)1 [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L817] FCALL, FORK 0 pthread_create(&t2397, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L742] 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_p2_EAX=0, __unbuffered_p2_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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L756] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L819] FCALL, FORK 0 pthread_create(&t2398, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L773] 3 __unbuffered_p2_EAX = x [L776] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L777] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L778] 3 y$flush_delayed = weak$$choice2 [L779] 3 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L780] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L780] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L781] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))=1, x=2, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L781] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L782] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L783] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L784] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L786] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L786] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L787] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L792] 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L742] 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) [L743] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L744] 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 [L759] EXPR 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_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y=0] [L793] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L794] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L795] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L759] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L760] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L761] 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 [L762] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L821] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L826] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L827] 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 [L828] 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 4 procedures, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 53.6s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 16.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4573 SDtfs, 5548 SDslu, 16653 SDs, 0 SdLazy, 10770 SolverSat, 321 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 281 GetRequests, 27 SyntacticMatches, 11 SemanticMatches, 243 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1819 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=148639occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 19.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 138088 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 1004 NumberOfCodeBlocks, 1004 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 916 ConstructedInterpolants, 0 QuantifiedInterpolants, 257585 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...